Sciweavers

1603 search results - page 117 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
COR
2010
152views more  COR 2010»
15 years 4 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
IJAIT
2010
167views more  IJAIT 2010»
15 years 2 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
GECCO
2004
Springer
15 years 9 months ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades
PDPTA
2003
15 years 5 months ago
Queryball: A New Model for Querying in Immersive VR Systems
— In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. In immersive VR systems, users expect int...
Chiemi Watanabe, Ayumi Osugi, Yoshifumi Masunaga, ...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 4 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani