874 search results - page 18 / 175 » Faster Algorithms for Semi-Matching Problems |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
ACST
2006
13 years 9 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Iterative shrinkage/thresholding (IST) algorithms have been recently proposed to handle high-dimensional convex optimization problems arising in image inverse problems (namely dec...
MEMOCODE
2003
IEEE
14 years 25 days ago
2003
IEEE
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...