Sciweavers

18090 search results - page 385 / 3618
» Computing by Only Observing
Sort
View
ITNG
2008
IEEE
16 years 1 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
ESCIENCE
2007
IEEE
16 years 1 months ago
A Framework for Providing Hard Delay Guarantees in Grid Computing
Future Grid Networks should be able to provide Quality of Service (QoS) guarantees to their users. In this work we propose a framework for Grid Networks that provides deterministi...
Panagiotis C. Kokkinos, Emmanouel A. Varvarigos, N...
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
16 years 27 days ago
Solutions to Computational Problems Through Gene Assembly
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
Artiom Alhazov, Ion Petre, Vladimir Rogojin
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
16 years 25 days ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
CCS
2005
ACM
16 years 8 days ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...