Sciweavers

8413 search results - page 1345 / 1683
» Ordering Problem Subgoals
Sort
View
CP
2006
Springer
15 years 8 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
CP
2006
Springer
15 years 8 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
116
Voted
CP
2006
Springer
15 years 8 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
CVPR
2006
IEEE
15 years 8 months ago
Tracking With Sobolev Active Contours
Recently proposed Sobolev active contours introduced a new paradigm for minimizing energies defined on curves by changing the traditional cost of perturbing a curve and thereby re...
Ganesh Sundaramoorthi, Jeremy D. Jackson, Anthony ...
DMSN
2006
ACM
15 years 8 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
« Prev « First page 1345 / 1683 Last » Next »