Sciweavers

4488 search results - page 154 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim
ICCBR
2005
Springer
16 years 11 days ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
ICSE
2009
IEEE-ACM
15 years 11 months ago
Automating Structural Testing of C Programs: Experience with PathCrawler
Structural testing is widely used in industrial verification processes of critical software. This report presents PathCrawler, a structural test generation tool that may be used ...
Bernard Botella, Mickaël Delahaye, Sté...
ECAI
2004
Springer
16 years 7 days ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
AEI
2004
150views more  AEI 2004»
15 years 6 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen