Sciweavers

8671 search results - page 331 / 1735
» A generator for hierarchical problems
Sort
View
JIRS
2006
74views more  JIRS 2006»
15 years 6 months ago
Exploratory Navigation Based on Dynamical Boundary Value Problems
The paper presents a general framework for concurrent navigation and exploration of unknown environments based on discrete potential fields that guide the robot motion. These poten...
Marcelo Trevisan, Marco Aurélio Pires Idiar...
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
DAM
2000
137views more  DAM 2000»
15 years 6 months ago
Solving the feedback vertex set problem on undirected graphs
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...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
COR
2007
157views more  COR 2007»
15 years 6 months ago
A decision support system for the single-depot vehicle rescheduling problem
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...
Jing-Quan Li, Denis Borenstein, Pitu B. Mirchandan...
KES
2010
Springer
15 years 5 months ago
Solving real-world vehicle routing problems with time windows using virus evolution strategy
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
Hitoshi Kanoh, Souichi Tsukahara