Sciweavers

98 search results - page 13 / 20
» Complexity of the traveling tournament problem
Sort
View
ACSC
2007
IEEE
14 years 1 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
13 years 11 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
AAAI
2008
13 years 10 months ago
Mathematical Modeling and Convergence Analysis of Trail Formation
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
Sameena Shah, Ravi Kothari, Jayadeva, Suresh Chand...
NETWORK
2010
158views more  NETWORK 2010»
13 years 2 months ago
Broadcasting safety information in vehicular networks: issues and approaches
A primary goal of intelligent transportation systems is to improve road safety. The ability of vehicles to communicate is a promising way to alleviate traffic accidents by reducin...
R. Chen, Wen-Long Jin, A. Regan