4679 search results - page 428 / 936 » Modeling When Connections Are the Problem |
179
click to vote
AROBOTS
2004
15 years 6 months ago
2004
In this paper, we introduce a self-assembling and self-organizing artifact, called a swarm-bot, composed of a swarm of s-bots, mobile robots with the ability to connect to and to ...
224
click to vote
NETWORKS
2011
15 years 1 months ago
2011
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
191
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
209
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
154
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...