Titlebook: SOFSEM ‘97: Theory and Practice of Informatics; 24th Seminar on Curr František Plášil,Keith G. Jeffery Conference proceedings 1997 Springer

Prostaglandins

Conference proceedings 1997 Czech Republic, in November 1997. SOFSEM is special in being a mix of a winter school, an international conference, and an advanced workshop meeting the demand for ongoing education in the area of computer science. The volume presents 22 invited contributions by leading experts together with 24 rev

桉树

Computer chess: Algorithms and heuristics for a deep look into the future, an overview about the sequential algorithms used. In the second part we will describe the parallelization that has been developed by us. The resulting parallel search algorithm has been used successfully in the chess program . even on massively parallel hardware. In 1992 . became Vize World Champio

多嘴多舌

开始没有

On the distributed realization of parallel algorithms,tions of parallel and distributed computing are represented by their interrelation. The possibility of distributed simulations of parallel models is discussed. Finally, the complexity theoretical consequences will be addressed.

处理

nonchalance

A foundation for computable analysis,ped. Several mutually non-equivalent theories have been proposed for it, none of which, however, has been accepted by the majority of mathematicians or computer scientists. In this contribution one of these theories, TTE (Type 2 Theorie of Effectivity), is presented, which at least in the author‘s o

medieval

圆锥体

Path layout in ATM networks,blems. We present a model for theoretical studies of these layouts, which amounts to covering the network with simple paths, under various constraints. The constraints are the hop count (the number of paths traversed between the vertices that have to communicate), the load (the number of paths that

招惹

Theory and practice in interactionally rich distributed systems,empts to show something of the breadth of recent research and practice, with a somewhat unintentional leaning towards the domain of scientific visualization in a broad sense. Theoretical work which may lay the foundations for a systematic understanding of interactionally rich systems is also discuss

Inordinate

Configuration-based programming systems, correct distributed applications. Briefly stated, configuration-based programming consists of describing an application using a configuration that defines interconnections between software components through connectors characterizing communication protocols. Existing work in the field of formal spe