5263 search results - page 524 / 1053 » Open Constraint Optimization |
162
click to vote
ASPDAC
2004
ACM
16 years 14 days ago
2004
ACM
—This paper focuses on SIMD processor synthesis and proposes a SIMD instruction set/functional unit synthesis algorithm. Given an initial assembly code and a timing constraint, t...
190
click to vote
CPAIOR
2010
Springer
15 years 12 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
194
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a method of synthesis of asynchronous circuits with relative timing. Asynchronous communication between gates and modules typically utilizes handshakes to ens...
158
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
211
click to vote
ECCV
1994
Springer
15 years 11 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...