Sciweavers

222 search results - page 5 / 45
» Locally Compact Path Spaces
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
114
Voted
PODC
2006
ACM
15 years 3 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
WWW
2007
ACM
15 years 10 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 1 months ago
Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi, Isao ...
60
Voted
ATAL
2004
Springer
15 years 2 months ago
Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
Dmitri A. Dolgov, Edmund H. Durfee