Sciweavers

664 search results - page 79 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
GD
1998
Springer
15 years 2 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
ATAL
2010
Springer
14 years 7 months ago
Occlusion-aware multi-UAV surveillance
We present an agent-based coordination and planning method for aerial surveillance of multiple urban areas using a group of fixed-wing unmanned aerial vehicles (UAVs). The method ...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
JSA
2000
115views more  JSA 2000»
14 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
WSDM
2012
ACM
290views Data Mining» more  WSDM 2012»
13 years 5 months ago
Online selection of diverse results
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwa...
COMGEO
2006
ACM
14 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw