Sciweavers

2006 search results - page 66 / 402
» Heuristic Security-Testing Methods
Sort
View
AIPS
2010
15 years 2 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
HEURISTICS
2007
76views more  HEURISTICS 2007»
15 years 15 days ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
HEURISTICS
2002
108views more  HEURISTICS 2002»
15 years 10 days ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau
85
Voted
PEPM
2009
ACM
15 years 9 months ago
Guided model checking for programs with polymorphism
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
Neha Rungta, Eric G. Mercer
88
Voted
IJCAI
2007
15 years 2 months ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...