3136 search results - page 301 / 628 » Genetic programming theory |
141
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
168
Voted
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
160
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
152
Voted
CCIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
204
click to vote
ECSQARU
2005
Springer
15 years 11 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...