4117 search results - page 190 / 824 » On the Satisfiability of Complex Constraints |
147
click to vote
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
161
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
179
click to vote
KBSE
2007
IEEE
16 years 25 days ago
2007
IEEE
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
196
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
156
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...