Sciweavers

1449 search results - page 104 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
174
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 6 months ago
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
Abbas Alhakim, Mufutau Akinwande
JAIR
2008
99views more  JAIR 2008»
15 years 6 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
IOR
2006
75views more  IOR 2006»
15 years 6 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt
ITA
2006
15 years 6 months ago
Decision problems among the main subfamilies of rational relations
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we in...
Olivier Carton, Christian Choffrut, Serge Grigorie...
DAM
2007
60views more  DAM 2007»
15 years 6 months ago
Restricting SBH ambiguity via restriction enzymes
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
Steven Skiena, Sagi Snir