3250 search results - page 385 / 650 » An Algorithm to Solve a Linear Program |
188
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
177
click to vote
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
195
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
172
click to vote
ASPDAC
2005
ACM
16 years 5 days ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
200
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...