Sciweavers

239 search results - page 46 / 48
» Probabilistic Concurrent Constraint Programming
Sort
View
IJCAI
1997
13 years 6 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
TAICPART
2010
IEEE
126views Education» more  TAICPART 2010»
13 years 3 months ago
Improved Testing through Refactoring: Experience from the ProTest Project
We report on how the Wrangler refactoring tool has been used to improve and transform test code for Erlang systems. This has been achieved through the removal of code clones, the i...
Huiqing Li, Simon J. Thompson
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
13 years 9 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
13 years 10 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
JPDC
2008
122views more  JPDC 2008»
13 years 5 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...