Sciweavers

102 search results - page 9 / 21
» A reading algorithm for constraint diagrams
Sort
View
AAAI
2008
13 years 10 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
ISVD
2010
IEEE
13 years 6 months ago
Fast Dynamic Voronoi Treemaps
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
Avneesh Sud, Danyel Fisher, Huai-Ping Lee
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
TPDS
2008
176views more  TPDS 2008»
13 years 7 months ago
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks
Communication is a primary source of energy consumption in wireless sensor networks. Due to resource constraints, the sensor nodes may not have enough energy to report every readin...
Xueyan Tang, Jianliang Xu
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger