153 search results - page 28 / 31 » An experimental study of greedy routing algorithms |
171
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
WWW
2009
ACM
15 years 2 months ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
ISLPED
2003
ACM
15 years 2 months ago
2003
ACM
Energy constrained systems such as sensor networks can increase their usable lifetimes by extracting energy from their environment. However, environmental energy will typically no...
92
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...