Sciweavers

1263 search results - page 145 / 253
» A* with Bounded Costs
Sort
View
UAI
2003
13 years 11 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
AAMAS
2007
Springer
13 years 9 months ago
A framework for meta-level control in multi-agent systems
Sophisticated agents operating in open environments must make decisions that efficiently trade off the use of their limited resources between dynamic deliberative actions and dom...
Anita Raja, Victor R. Lesser
JGTOOLS
2008
126views more  JGTOOLS 2008»
13 years 9 months ago
Simple Empty-Space Removal for Interactive Volume Rendering
Interactive volume rendering methods such as texture-based slicing techniques and ray-casting have been well developed in recent years. The rendering performance is generally restr...
Vincent Vidal 0002, Xing Mei, Philippe Decaudin
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 9 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 9 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti