Sciweavers

216 search results - page 27 / 44
» Covering Problems with Hard Capacities
Sort
View
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
14 years 1 months ago
Learning nonparametric policies by imitation
— A long cherished goal in artificial intelligence has been the ability to endow a robot with the capacity to learn and generalize skills from watching a human teacher. Such an ...
David B. Grimes, Rajesh P. N. Rao
INFOCOM
2005
IEEE
14 years 1 months ago
On achieving optimal throughput with network coding
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau
GIS
2007
ACM
14 years 8 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
ISCA
2011
IEEE
294views Hardware» more  ISCA 2011»
12 years 11 months ago
Moguls: a model to explore the memory hierarchy for bandwidth improvements
In recent years, the increasing number of processor cores and limited increases in main memory bandwidth have led to the problem of the bandwidth wall, where memory bandwidth is b...
Guangyu Sun, Christopher J. Hughes, Changkyu Kim, ...