315 search results - page 10 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
DAM
2000
13 years 8 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
AIPS
2004
13 years 10 months ago
2004
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
TEC
2002
13 years 8 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...