Sciweavers

9687 search results - page 1739 / 1938
» On Natural Mobility Models
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
AI
2006
Springer
15 years 6 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
AUTOMATICA
2006
101views more  AUTOMATICA 2006»
15 years 6 months ago
A risk-sensitive approach to total productive maintenance
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
Abhijit Gosavi
GEOINFORMATICA
2008
73views more  GEOINFORMATICA 2008»
15 years 6 months ago
Reporting Leaders and Followers among Trajectories of Moving Point Objects
Abstract. Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving...
Mattias Andersson, Joachim Gudmundsson, Patrick La...
GRID
2008
Springer
15 years 6 months ago
Replica Placement Strategies in Data Grid
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereb...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
« Prev « First page 1739 / 1938 Last » Next »