874 search results - page 32 / 175 » Faster Algorithms for Semi-Matching Problems |
DAC
1994
ACM
13 years 11 months ago
1994
ACM
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Different features have different relevance to a particular learning problem. Some features are less relevant; while some very important. Instead of selecting the most relevant fe...
IJCAI
2003
13 years 9 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...