Sciweavers

4198 search results - page 71 / 840
» In search of lost time
Sort
View
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
15 years 11 months ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
ESOA
2006
15 years 9 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
AIIDE
2008
15 years 8 months ago
Stochastic Plan Optimization in Real-Time Strategy Games
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
Andrew Trusty, Santiago Ontañón, Ash...
JUCS
2008
153views more  JUCS 2008»
15 years 5 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
CCCG
2010
15 years 7 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson