6315 search results - page 1089 / 1263 » Approximating Solution Structure |
173
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
149
click to vote
DBISP2P
2004
Springer
15 years 11 months ago
2004
Springer
Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solut...
153
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
182
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
158
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...