Sciweavers

849 search results - page 3 / 170
» The Early Restart Algorithm
Sort
View
CP
2007
Springer
15 years 10 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
FECS
2010
199views Education» more  FECS 2010»
15 years 2 months ago
Algoritharium: Facilitating an Early Focus on Algorithms in an Objects-Early CS1 Course
Introducing large-scale problems early in the CS1 course has been shown to be an effective way to teach algorithmic concepts. Adopting this approach in a CS1 course taught in Java,...
Sridhar Narayan, Jack Tompkins, Gene A. Tagliarini
AAAI
2006
15 years 5 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
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, ...
Meinolf Sellmann, Carlos Ansótegui