Sciweavers

6514 search results - page 424 / 1303
» Low-Knowledge Algorithm Control
Sort
View
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 9 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
15 years 9 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 8 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 8 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 5 months ago
Is "best-so-far" a good algorithmic performance metric?
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
Nathaniel P. Troutman, Brent E. Eskridge, Dean F. ...