Sciweavers

2313 search results - page 140 / 463
» On Heuristic Time Hierarchies
Sort
View
IPPS
1999
IEEE
15 years 10 months ago
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
Ahmad Afsahi, Nikitas J. Dimopoulos
WSC
1998
15 years 7 months ago
Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
Joel L. Ryan, T. Glenn Bailey, James T. Moore, Wil...
EOR
2007
101views more  EOR 2007»
15 years 6 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
PAMI
2008
152views more  PAMI 2008»
15 years 6 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
16 years 1 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han