Sciweavers

192 search results - page 7 / 39
» On-Demand Bound Computation for Best-First Constraint Optimi...
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
CDC
2008
IEEE
106views Control Systems» more  CDC 2008»
15 years 4 months ago
Less conservative robust control of constrained linear systems with bounded disturbances
— This paper develops a novel robust control method for linear systems subject to additive and bounded disturbances. The approach is based on constraint tightening method. The pr...
Reza Ghaemi, Jing Sun, Ilya V. Kolmanovsky
ATAL
2009
Springer
15 years 4 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
CC
2011
Springer
270views System Software» more  CC 2011»
14 years 1 months ago
Subregion Analysis and Bounds Check Elimination for High Level Arrays
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
JSAT
2006
88views more  JSAT 2006»
14 years 9 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva