Sciweavers

248 search results - page 4 / 50
» Clustering Search Approach for the Traveling Tournament Prob...
Sort
View
GIS
2004
ACM
16 years 23 days ago
Discovering personal gazetteers: an interactive clustering approach
Personal gazetteers record individuals' most important places, such as home, work, grocery store, etc. Using personal gazetteers in location-aware applications offers additio...
Changqing Zhou, Dan Frankowski, Pamela J. Ludford,...
OR
2007
Springer
14 years 11 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
COR
2006
140views more  COR 2006»
14 years 11 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
ANOR
2010
130views more  ANOR 2010»
14 years 12 months ago
Metaheuristic methods based on Tabu search for assigning judges to competitions
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting...
Amina Lamghari, Jacques A. Ferland
VLDB
2007
ACM
109views Database» more  VLDB 2007»
15 years 12 months ago
FluxCapacitor: Efficient Time-Travel Text Search
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...