Sciweavers

1763 search results - page 119 / 353
» A Formalization of Polytime Functions
Sort
View
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 2 months ago
On Analog Signature Analysis
We formalize the problem of analog data compression and analyze the existence of a polynomial data compression function. Under relaxed conditions we explore the existence of a sol...
Franc Novak, Bojan Hvala, Sandi Klavzar
EUROGP
2004
Springer
15 years 1 months ago
On the Evolution of Evolutionary Algorithms
In this paper we discuss the evolution of several components of a traditional Evolutionary Algorithm, such as genotype to phenotype mappings and genetic operators, presenting a for...
Jorge Tavares, Penousal Machado, Amílcar Ca...
ANLP
2000
95views more  ANLP 2000»
14 years 11 months ago
Extracting Molecular Binding Relationships from Biomedical Text
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified lingu...
Thomas C. Rindflesch, Jayant V. Rajan, Lawrence Hu...
CLEIEJ
2006
120views more  CLEIEJ 2006»
14 years 10 months ago
A semantics for while with break, continue and goto
This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alpha...
Patricia Peratto
ENTCS
2006
127views more  ENTCS 2006»
14 years 10 months ago
Component Identification Through Program Slicing
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...
Nuno F. Rodrigues, Luís Soares Barbosa