Sciweavers

2887 search results - page 407 / 578
» Name Generation and Linearity
Sort
View
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
15 years 6 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
BELL
2000
107views more  BELL 2000»
15 years 6 months ago
Automating software feature verification
A significant part of the call processing software for Lucent's new PathStar access server [FSW98] was checked with automated formal verification techniques. The verification...
Gerard J. Holzmann, Margaret H. Smith
JIIS
2000
120views more  JIIS 2000»
15 years 6 months ago
Machine Learning for Intelligent Processing of Printed Documents
Abstract. A paper document processing system is an information system component which transforms information on printed or handwritten documents into a computer-revisable form. In ...
Floriana Esposito, Donato Malerba, Francesca A. Li...
NN
2000
Springer
137views Neural Networks» more  NN 2000»
15 years 6 months ago
Evolutionary robots with on-line self-organization and behavioral fitness
We address two issues in Evolutionary Robotics, namely the genetic encoding and the performance criterion, also known as fitness function. For the first aspect, we suggest to enco...
Dario Floreano, Joseba Urzelai
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
15 years 6 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée