5316 search results - page 34 / 1064 » Which Search Problems Are Random |
114
click to vote
EDM
2009
15 years 1 months ago
2009
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
146
click to vote
AIPS
2007
15 years 5 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
161
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
170
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
113
click to vote
AAAI
2006
15 years 4 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...