17760 search results - page 284 / 3552 » A Generalization of the Massey-Ding Algorithm |
139
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
163
click to vote
PRICAI
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
177
click to vote
DNA
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of ...
156
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
175
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present an algorithm to calculate the control input when the processing resources available are time-varying. The basic idea is to calculate the components of the control in...