Sciweavers

327 search results - page 47 / 66
» A fully dynamic algorithm for planar
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
Adriana Iamnitchi, Ian T. Foster
AAAI
2010
13 years 9 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
CORR
2010
Springer
432views Education» more  CORR 2010»
13 years 7 months ago
A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks du...
Jaydip Sen
IWCMC
2010
ACM
13 years 9 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...