12519 search results - page 297 / 2504 » Approximation Problems Categories |
189
click to vote
DSD
2005
IEEE
16 years 7 days 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...
162
click to vote
DATE
1998
IEEE
15 years 11 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...
178
click to vote
IAAI
2003
15 years 8 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...
170
click to vote
AAAI
2010
15 years 6 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...
181
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...