Sciweavers

863 search results - page 80 / 173
» The Light Bulb Problem
Sort
View
KI
1999
Springer
15 years 7 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
15 years 6 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...
AIPS
2000
15 years 4 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
MP
2008
60views more  MP 2008»
15 years 3 months ago
Extreme optics and the search for Earth-like planets
In this paper I describe a new and exciting application of optimization technology. The problem is to design a space telescope capable of imaging Earth-like planets around nearby s...
Robert J. Vanderbei
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 2 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta