15033 search results - page 228 / 3007 » Complexity Theory and Algorithms |
189
Voted
TSP
2008
15 years 4 months ago
2008
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
129
Voted
KCAP
2003
ACM
15 years 9 months ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
125
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
148
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
132
Voted
EUROGP
2001
Springer
15 years 9 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...