743 search results - page 61 / 149 » Constraint Programming Architectures: Review and a New Propo... |
153
click to vote
COR
2010
15 years 6 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
149
click to vote
CF
2004
ACM
15 years 11 months ago
2004
ACM
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
188
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
143
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
171
click to vote
ARC
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new paradigm in the computer architecture referred to as Polymorphic Instruction Set Computers (PISC). This new paradigm, in difference to RISC/CISC, introduces hard...