Sciweavers

246 search results - page 26 / 50
» Efficient Algorithms for Inverting Evolution
Sort
View
RTSS
1996
IEEE
13 years 11 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
BMCBI
2007
86views more  BMCBI 2007»
13 years 7 months ago
Detecting microsatellites within genomes: significant variation among algorithms
Background: Microsatellites are short, tandemly-repeated DNA sequences which are widely distributed among genomes. Their structure, role and evolution can be analyzed based on exh...
Sébastien Leclercq, Eric Rivals, Philippe J...
CEC
2005
IEEE
14 years 1 months ago
Adaptive cluster covering and evolutionary approach: comparison, differences and similarities
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...
Dimitri P. Solomatine
ET
2002
67views more  ET 2002»
13 years 7 months ago
On-the-Fly Reseeding: A New Reseeding Technique for Test-Per-Clock BIST
In this paper we present a new reseeding technique for test-per-clock test pattern generation suitable for at-speed testing of circuits with random-pattern resistant faults. Our te...
Emmanouil Kalligeros, Xrysovalantis Kavousianos, D...