1096 search results - page 117 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
180
click to vote
NIPS
2008
15 years 7 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
147
click to vote
NIXDORF
1992
15 years 10 months ago
1992
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
151
click to vote
ICDM
2008
IEEE
16 years 25 days ago
2008
IEEE
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
194
click to vote
ICDM
2005
IEEE
16 years 8 hour ago
2005
IEEE
In this paper, we deal with mining sequential patterns in multiple data streams. Building on a state-of-the-art sequential pattern mining algorithm PrefixSpan for mining transact...
182
click to vote
ICTAI
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...