Sciweavers

239 search results - page 35 / 48
» Probabilistic Concurrent Constraint Programming
Sort
View
AI
1999
Springer
13 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
INFOCOM
2006
IEEE
14 years 2 months 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
ICLP
1990
Springer
14 years 23 days 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
CPAIOR
2008
Springer
13 years 10 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle