14548 search results - page 187 / 2910 » The Optimal Path-Matching Problem |
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...
AAAI
2012
12 years 1 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
ICRA
2010
IEEE
13 years 9 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization an...
GECCO
2009
Springer
13 years 8 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...