Sciweavers

13376 search results - page 143 / 2676
» Problem Solving with
Sort
View
AAAI
2000
15 years 4 months ago
Combining Knowledge and Search to Solve Single-Suit Bridge
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
Ian Frank, David A. Basin, Alan Bundy
UAI
2004
15 years 4 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
SAGA
2001
Springer
15 years 7 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
IPPS
1999
IEEE
15 years 7 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 8 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan