486 search results - page 92 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
154
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
160
click to vote
ICWN
2008
15 years 6 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
151
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
149
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
176
click to vote
NEUROSCIENCE
2001
Springer
15 years 9 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...