Sciweavers

2109 search results - page 2 / 422
» Solving Necklace Constraint Problems
Sort
View
DAGSTUHL
2007
13 years 6 months ago
An analytic solution to the alibi query in the bead model for moving object data
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
Bart Kuijpers, Walied Othman
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 2 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
TASLP
2010
78views more  TASLP 2010»
12 years 11 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
CONSTRAINTS
2011
12 years 12 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
IJCAI
2007
13 years 6 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...