Sciweavers

412 search results - page 77 / 83
» Completion for Multiple Reduction Orderings
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 7 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
14 years 2 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler
NOMS
2008
IEEE
105views Communications» more  NOMS 2008»
14 years 1 months ago
Characterization of IP flows eligible for lambda-connections in optical networks
Abstract—The advance on data transmission in optical networks has allowed data forwarding decisions to be taken at multiple levels in the protocol stack (e.g., at network and opt...
Tiago Fioreze, Mattijs Oude Wolbers, Remco van de ...
CCGRID
2005
IEEE
14 years 29 days ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...