315 search results - page 49 / 63 » Are Multiple Runs of Genetic Algorithms Better than One |
ALGORITHMICA
2005
13 years 10 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
VLDB
1998
ACM
14 years 3 months ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
In this paper, we show that most multiple term queries include more than one topic and users usually reformulate their queries by topics instead of terms. In order to provide empi...
DAC
1994
ACM
14 years 2 months ago
1994
ACM
Acyclic partitioning on combinational boolean networks has wide range of applications, from multiple FPGA chip partitioning to parallel circuit simulation. In this paper, we prese...
ICPADS
1998
IEEE
14 years 3 months ago
1998
IEEE
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...