Sciweavers

598 search results - page 20 / 120
» Stably compact spaces
Sort
View
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
14 years 27 days ago
Learning basic navigation for personal satellite assistant using neuroevolution
The Personal Satellite Assistant (PSA) is a small robot proposed by NASA to assist astronauts who are living and working aboard the space shuttle or space station. To help the ast...
Yiu-Fai Sit, Risto Miikkulainen
ASPLOS
2008
ACM
13 years 9 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
ICNP
2007
IEEE
14 years 1 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
PODC
2006
ACM
14 years 1 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...