2976 search results - page 207 / 596 » On the bounded integer programming |
151
click to vote
ISCAS
2005
IEEE
16 years 2 days ago
2005
IEEE
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
178
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
185
click to vote
ORL
2007
15 years 6 months ago
2007
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
166
click to vote
CINQ
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
166
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...