4428 search results - page 342 / 886 » The Chow Parameters Problem |
222
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
178
click to vote
IPL
2010
15 years 5 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
247
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
205
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
195
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...