Sciweavers

2109 search results - page 240 / 422
» Solving Necklace Constraint Problems
Sort
View
CP
2006
Springer
15 years 9 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
JMLR
2006
125views more  JMLR 2006»
15 years 6 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
166
Voted
JNSM
2008
130views more  JNSM 2008»
15 years 6 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
IROS
2009
IEEE
165views Robotics» more  IROS 2009»
16 years 21 days ago
Autonomous altitude estimation of a UAV using a single onboard camera
Abstract— Autonomous estimation of the altitude of an Unmanned Aerial Vehicle (UAV) is extremely important when dealing with flight maneuvers like landing, steady flight, etc. ...
Anoop Cherian, Jonathan Andersh, Vassilios Morella...
ATAL
2008
Springer
15 years 8 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun