1963 search results - page 153 / 393 » Applications of Preferences using Answer Set Programming |
128
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
130
Voted
PAMI
2007
15 years 3 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
128
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
132
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
122
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...