Sciweavers

248 search results - page 8 / 50
» Clustering Search Approach for the Traveling Tournament Prob...
Sort
View
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
14 years 2 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
DCOSS
2011
Springer
12 years 7 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Quick-and-dirty ant colony optimization
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
Paola Pellegrini, Elena Moretti
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
WAIM
2005
Springer
14 years 25 days ago
Research Paper Recommender Systems: A Subspace Clustering Approach
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...
Nitin Agarwal, Ehtesham Haque, Huan Liu, Lance Par...