Sciweavers

2584 search results - page 322 / 517
» On the Forward Checking Algorithm
Sort
View
93
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
To Cache or Not To Cache?
—We address cooperative caching in mobile ad hoc networks where information is exchanged in a peer-to-peer fashion among the network nodes. Our objective is to devise a fully-dis...
Marco Fiore, Francesco Mininni, Claudio Casetti, C...
124
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
127
Voted
LICS
2009
IEEE
15 years 9 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
117
Voted
ACSC
2008
IEEE
15 years 9 months ago
Product flow analysis in distribution networks with a fixed time horizon
The movement of items through a product distribution network is a complex dynamic process which depends not only on the network’s static topology but also on a knowledge of how ...
Moe Thandar Wynn, Colin J. Fidge, Arthur H. M. ter...
AINA
2008
IEEE
15 years 9 months ago
PRODUCE: A Probability-Driven Unequal Clustering Mechanism for Wireless Sensor Networks
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
Jung-Hwan Kim, Sajjad Hussain Chauhdary, WenCheng ...