Sciweavers

422 search results - page 83 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
PDP
2003
IEEE
13 years 11 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
DEBS
2008
ACM
13 years 6 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
ESAS
2006
Springer
13 years 9 months ago
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
Subhas Kumar Ghosh
AAAI
1996
13 years 7 months ago
Robot Navigation Using Image Sequences
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
Christopher Rasmussen, Gregory D. Hager
WG
2007
Springer
13 years 12 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder