Sciweavers

1275 search results - page 100 / 255
» time 1998
Sort
View
COLING
2008
13 years 11 months ago
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
Holger Wunsch
FLAIRS
1998
13 years 11 months ago
The Path Planning Component of an Architecture for Autonomous Vehicles
Path planning for an autonomousvehicle can occur at twodifferent times. First, path planning might occur at mission specification time when the vehicle's initial path is dete...
Richard Fox, Antonio Garcia Jr., Michael L. Nelson
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
WSC
1998
13 years 11 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...
WSC
1998
13 years 11 months ago
Experiments in Load Migration and Dynamic Load Balancing in SPEEDES
It is well known that the performance of a parallel discreteevent simulation (PDES) depends on the allocation of the workload to processors. In particular, poor performance may be...
Linda F. Wilson, Wei Shen