Sciweavers

8431 search results - page 170 / 1687
» Algorithmically Independent Sequences
Sort
View
136
Voted
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 7 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 8 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
ICST
2010
IEEE
15 years 26 days ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 7 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
ICML
1995
IEEE
16 years 3 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter