2899 search results - page 34 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
169
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
104
click to vote
EMSOFT
2007
Springer
15 years 7 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
137
click to vote
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
111
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 1 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
134
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...