Rainer Feldmann (auth.), František Plášil, Keith G. Jeffery (eds.)3540637745, 9783540637745
Table of contents :
Computer chess: Algorithms and heuristics for a deep look into the future….Pages 1-18
Algorithms for triangulated terrains….Pages 19-36
On the distributed realization of parallel algorithms….Pages 37-52
The fundamental problem of database design….Pages 53-69
Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP)….Pages 70-85
The computational power of continuous time neural networks….Pages 86-103
A foundation for computable analysis….Pages 104-121
Towards machines that can think….Pages 122-141
Computational complexity of continuous problems….Pages 142-143
Path layout in ATM networks….Pages 144-160
The mobile agent technology….Pages 161-162
Theory and practice in interactionally rich distributed systems….Pages 163-182
Configuration-based programming systems….Pages 183-200
Automatic generation of parallelizing compilers for object-oriented programming languages from denotational semantics specifications….Pages 201-218
A formal software engineering paradigm: From domains via requirements to software – Formal specification & design calculi -….Pages 219-248
The whole picture to software process improvement….Pages 249-265
Object-oriented design patterns….Pages 266-274
Object-oriented DBMS and beyond….Pages 275-294
On integration of relational and object-oriented database systems….Pages 295-312
From OO through deduction to active databases — ROCK, ROLL & RAP….Pages 313-330
An introduction to virtual reality modeling language….Pages 331-348
Stepping stones to an information society….Pages 349-372
Lower bounds for the virtual path layout problem in ATM networks….Pages 373-382
Query processing in temporal evidential databases….Pages 383-390
A first approach to temporal predicate locking for concurrency detection in temporal relational databases supporting schema versioning….Pages 391-398
Efficient insertion of approximately sorted sequences of items into a dictionary….Pages 399-406
High availability support in CORBA environments….Pages 407-414
On f-sparse sets in NP – P….Pages 415-422
Zero-overhead exception handling using metaprogramming….Pages 423-431
The output-store formal translator directed by LR parsing….Pages 432-439
Parallel processing on alphas under MATLAB 5….Pages 440-447
PRAM lower bound for element distinctness revisited….Pages 448-455
Optimal trees for searching in codebook….Pages 456-463
Time optimal self-stabilizing algorithms….Pages 464-472
Requirements specification iteratively combined with reverse engineering….Pages 473-480
On finite representations of infinite-state behaviours….Pages 481-488
Efficient strong sequentiality using replacement restrictions….Pages 489-496
Optimal encodings….Pages 497-504
Monotonic rewriting automata with a restart operation….Pages 505-512
Kahn’s fixed-point characterization for linear dynamic networks….Pages 513-522
DESAM — Annotated corpus for Czech….Pages 523-530
Mobility management in CORBA: A generic implementation of the lifecycle service….Pages 531-538
A theory of game trees, based on solution trees….Pages 539-546
Approximation algorithms for the vertex bipartization problem….Pages 547-554
Optical all-to-all communication for some product graphs (Extended Abstract)….Pages 555-562
Parallelizing self-organizing maps….Pages 563-570
Reviews
There are no reviews yet.