2752 search results - page 11 / 551 » Rounding to an Integral Program |
110
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
142
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
116
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
125
Voted
ICCD
2008
IEEE
16 years 17 days ago
2008
IEEE
— Test-access mechanisms (TAMs) and test wrappers (e.g., the IEEE Standard 1500 wrapper) facilitate the modular testing of embedded cores in a core-based system-on-chip (SOC). Su...
123
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The article concerns problems of formulating standard requirements to implementations of mathematical functions working with floating-point numbers and conformance test ...