Sciweavers

17 search results - page 3 / 4
» Finding the K shortest hyperpaths using reoptimization
Sort
View
ANTSW
2010
Springer
13 years 5 months ago
Autonomous Multi-agent Cycle Based Patrolling
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Yotam Elor, Alfred M. Bruckstein
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 7 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
HICSS
2006
IEEE
179views Biometrics» more  HICSS 2006»
14 years 1 months ago
e-Government Integration with Web Services and Alerts: A Case Study on an Emergency Route Advisory System in Hong Kong
Quick and efficient response to emergency is important for every city. This depends on the quality of the dispatch of emergency service to the scene and back to hospital or other ...
Cherrie W. W. Ng, Dickson K. W. Chiu
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 9 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
MOBISYS
2010
ACM
13 years 10 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...