Sciweavers

10055 search results - page 70 / 2011
» Structured programming using processes
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Minimax design of adjustable FIR filters using 2D polynomial methods
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
Bogdan Dumitrescu, Bogdan C. Sicleru, Radu Stefan
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 7 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
CEC
2009
IEEE
14 years 2 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
DATESO
2009
101views Database» more  DATESO 2009»
13 years 5 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
APSEC
2002
IEEE
14 years 22 days ago
Embedding XML Processing Toolkit on General Purpose Programming Language
Many methods for XML processing have been proposed in the last few years. One popular approach is to process XML documents by using existing programming languages. Another popular...
Tetsuo Kamina, Tetsuo Tamai