4426 search results - page 521 / 886 » Concurrent Constraint Programming |
186
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
177
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
165
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
161
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
328
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...