Sciweavers

303 search results - page 31 / 61
» Traveling Salesman Problem with Transportation
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 7 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
COGSCI
2010
234views more  COGSCI 2010»
15 years 6 months ago
High Regularities in Eye-Movement Patterns Reveal the Dynamics of the Visual Working Memory Allocation Mechanism
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
Xiaohui Kong, Christian D. Schunn, Garrick L. Wall...
SIGMOD
2007
ACM
108views Database» more  SIGMOD 2007»
16 years 6 months ago
Travel time estimation using NiagaraST and latte
To address increasing traffic congestion and its associated consequences, traffic managers are turning to intelligent transportation management. The latte project is extending dat...
Kristin Tufte, Jin Li, David Maier, Vassilis Papad...
CPAIOR
2006
Springer
15 years 9 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick