Sciweavers

3825 search results - page 235 / 765
» More on pooling spaces
Sort
View
ECAI
2004
Springer
15 years 12 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
HUC
2009
Springer
15 years 11 months ago
Applying pervasive technologies to create economic incentives that alter consumer behavior
Economic incentives are a powerful way of shaping consumer behavior towards more commercially efficient and environmentally sustainable patterns. In this paper, we explore the id...
Tetsuo Yamabe, Vili Lehdonvirta, Hitoshi Ito, Hayu...
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
15 years 11 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
ARCS
2006
Springer
15 years 10 months ago
Efficient System-on-Chip Energy Management with a Segmented Bloom Filter
As applications tend to grow more complex and use more memory, the demand for cache space increases. Thus embedded processors are inclined to use larger caches. Predicting a miss i...
Mrinmoy Ghosh, Emre Özer, Stuart Biles, Hsien...
CPAIOR
2006
Springer
15 years 8 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams