4843 search results - page 191 / 969 » The Shortcut Problem - Complexity and Approximation |
135
click to vote
DSD
2005
IEEE
15 years 9 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
125
click to vote
DATE
1998
IEEE
15 years 7 months ago
1998
IEEE
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
125
Voted
IAAI
2003
15 years 4 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
122
click to vote
AAAI
2010
15 years 3 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
110
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...