Sciweavers

438 search results - page 10 / 88
» New Search Heuristics for Max-CSP
Sort
View
AAAI
2010
14 years 11 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
AI
2002
Springer
14 years 9 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
89
Voted
ECMDAFA
2010
Springer
228views Hardware» more  ECMDAFA 2010»
15 years 28 days ago
Example-Based Sequence Diagrams to Colored Petri Nets Transformation Using Heuristic Search
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
Marouane Kessentini, Arbi Bouchoucha, Houari A. Sa...
ISMIS
1999
Springer
15 years 1 months ago
Improving Backtrack Search for SAT by Means of Redundancy
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
Laure Brisoux, Éric Grégoire, Lakhda...
COR
2004
139views more  COR 2004»
14 years 9 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland