273 search results - page 39 / 55 » Can Pure Cutting Plane Algorithms Work |
125
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
158
click to vote
ICCAD
2001
IEEE
16 years 21 days ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
139
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-do...
154
Voted
INFOCOM
1999
IEEE
15 years 8 months ago
1999
IEEE
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
151
click to vote
CLOUD
2010
ACM
15 years 9 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...