Sciweavers

2752 search results - page 18 / 551
» Rounding to an Integral Program
Sort
View
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 5 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DEXAW
2009
IEEE
141views Database» more  DEXAW 2009»
13 years 9 months ago
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on se...
Rafael Deitos, Florian Kerschbaum
CAEPIA
2011
Springer
12 years 8 months ago
Solving Sequential Mixed Auctions with Integer Programming
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...
Boris Mikhaylov, Jesús Cerquides, Juan A. R...