1299 search results - page 22 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
144
Voted
SOFSEM
2010
Springer
16 years 20 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
136
Voted
ASPDAC
2000
ACM
15 years 8 months ago
2000
ACM
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
132
click to vote
JC
2000
15 years 3 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
158
Voted
ACMSE
2007
ACM
15 years 7 months ago
2007
ACM
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
117
click to vote
JNS
2010
2010
Initiation of Cracks in Griffith's Theory: An Argument of Continuity in Favor of Global Minimization
14 years 10 months ago
The initiation of a crack in a sound body is a real issue in the setting of Griffith's theory of brittle fracture. If one uses the concept of critical energy release rate (Gri...