3663 search results - page 282 / 733 » Problems in the ontology of computer programs |
217
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
169
click to vote
EUROGP
2008
Springer
15 years 8 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
170
click to vote
DAM
2006
15 years 6 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
141
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
175
Voted
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.