3136 search results - page 367 / 628 » Genetic programming theory |
163
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
147
click to vote
AGI
2008
15 years 8 months ago
2008
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...
176
click to vote
DAGSTUHL
2001
15 years 8 months ago
2001
Abstract. Language-based security leverages program analysis and program rewriting to enforce security policies. The approach promises efficient enforcement of fine-grained access ...
131
click to vote
CACM
2004
15 years 6 months ago
2004
s (theory, abstraction, and design) [2]. They put programming as a subpart of the design component of most of the nine areas, especially algorithms and software engineering. Their ...
201
click to vote
ENTCS
2002
15 years 6 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...