SOFSEM '97: Theory and Practice of Informatics: 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 1997. Proceedings: Lecture Notes in Computer Science, cartea 1338
Editat de Frantisek Plasil, Keith G. Jefferyen Limba Engleză Paperback – 5 noi 1997
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 339.92 lei
Preț vechi: 424.89 lei
-20% Nou
Puncte Express: 510
Preț estimativ în valută:
65.07€ • 67.64$ • 53.95£
65.07€ • 67.64$ • 53.95£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540637745
ISBN-10: 3540637745
Pagini: 596
Ilustrații: XIV, 582 p.
Dimensiuni: 155 x 233 x 31 mm
Greutate: 0.82 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540637745
Pagini: 596
Ilustrații: XIV, 582 p.
Dimensiuni: 155 x 233 x 31 mm
Greutate: 0.82 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Computer chess: Algorithms and heuristics for a deep look into the future.- Algorithms for triangulated terrains.- On the distributed realization of parallel algorithms.- The fundamental problem of database design.- Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP).- The computational power of continuous time neural networks.- A foundation for computable analysis.- Towards machines that can think.- Computational complexity of continuous problems.- Path layout in ATM networks.- The mobile agent technology.- Theory and practice in interactionally rich distributed systems.- Configuration-based programming systems.- Automatic generation of parallelizing compilers for object-oriented programming languages from denotational semantics specifications.- A formal software engineering paradigm: From domains via requirements to software - Formal specification & design calculi -.- The whole picture to software process improvement.- Object-oriented design patterns.- Object-oriented DBMS and beyond.- On integration of relational and object-oriented database systems.- From OO through deduction to active databases — ROCK, ROLL & RAP.- An introduction to virtual reality modeling language.- Stepping stones to an information society.- Lower bounds for the virtual path layout problem in ATM networks.- Query processing in temporal evidential databases.- A first approach to temporal predicate locking for concurrency detection in temporal relational databases supporting schema versioning.- Efficient insertion of approximately sorted sequences of items into a dictionary.- High availability support in CORBA environments.- On f-sparse sets in NP - P.- Zero-overhead exception handling using metaprogramming.- The output-store formal translator directed by LRparsing.- Parallel processing on alphas under MATLAB 5.- PRAM lower bound for element distinctness revisited.- Optimal trees for searching in codebook.- Time optimal self-stabilizing algorithms.- Requirements specification iteratively combined with reverse engineering.- On finite representations of infinite-state behaviours.- Efficient strong sequentiality using replacement restrictions.- Optimal encodings.- Monotonic rewriting automata with a restart operation.- Kahn's fixed-point characterization for linear dynamic networks.- DESAM — Annotated corpus for Czech.- Mobility management in CORBA: A generic implementation of the lifecycle service.- A theory of game trees, based on solution trees.- Approximation algorithms for the vertex bipartization problem.- Optical all-to-all communication for some product graphs (Extended Abstract).- Parallelizing self-organizing maps.