Sciweavers

2542 search results - page 291 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
110
Voted
GECCO
2008
Springer
261views Optimization» more  GECCO 2008»
15 years 1 months ago
SSNNS -: a suite of tools to explore spiking neural networks
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...
Heike Sichtig, J. David Schaffer, Craig B. Laramee
INFOCOM
2010
IEEE
14 years 11 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
121
Voted
CGF
2011
14 years 4 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
PODC
2011
ACM
14 years 3 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
AIPS
2009
15 years 1 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla