Sciweavers

5180 search results - page 209 / 1036
» Concurrency, Time, and Constraints
Sort
View
DISOPT
2007
81views more  DISOPT 2007»
15 years 6 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
INFOCOM
2006
IEEE
16 years 19 days ago
Holographic and 3D Teleconferencing and Visualization: Implications for Terabit Networked Applications
— We discuss the evolution of teleconferencing and networked visualization applications to support 3-dimensional display technologies. The implications of a continuation of Moore...
Ladan Gharai, Colin Perkins
POPL
1992
ACM
15 years 10 months ago
Semantic Foundations of Jade
Jade is a language designed to support coarse-grain parallelism on both shared and distributed addressspace machines. Jade is data-oriented: a Jade programmer simply augments a se...
Martin C. Rinard, Monica S. Lam
ICLP
1990
Springer
15 years 10 months ago
Kernel Andorra Prolog and its Computation Model
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
Seif Haridi, Sverker Janson
ICFEM
2000
Springer
15 years 10 months ago
Using Use Cases in Executable Z
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, bes...
Wolfgang Grieskamp, Markus Lepper