Sciweavers

9842 search results - page 321 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COMPGEOM
2003
ACM
16 years 2 days ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
ICCS
2003
Springer
16 years 18 hour ago
Towards Biomedical Problem Solving in a Game Environment
Biomedical systems involve complex interactions between diverse components. Problem solving in such systems requires insight, i.e. the capability to make non-obvious connections. I...
Yang Cai 0002, Ingo Snel, B. Suman Bharathi, Cleme...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
16 years 28 days ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
E4MAS
2005
Springer
16 years 10 days ago
An Environment-Based Methodology to Design Reactive Multi-agent Systems for Problem Solving
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
Olivier Simonin, Franck Gechter
165
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 10 days ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...