Sciweavers

2069 search results - page 164 / 414
» Linear time algorithms for Clobber
Sort
View
138
Voted
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
15 years 10 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
ATS
2003
IEEE
93views Hardware» more  ATS 2003»
15 years 10 months ago
Optimal System-on-Chip Test Scheduling
1 In this paper, we show that the scheduling of tests on the test access mechanism (TAM) is equivalent to independent job scheduling on identical machines and we make use of an exi...
Erik Larsson, Hideo Fujiwara
146
Voted
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 9 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
ANTS
1998
Springer
135views Algorithms» more  ANTS 1998»
15 years 8 months ago
Fast Multiprecision Evaluation of Series of Rational Numbers
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
Bruno Haible, Thomas Papanikolaou
221
Voted
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
15 years 3 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha