4126 search results - page 400 / 826 » Set based logic programming |
143
Voted
LFP
1992
15 years 5 months ago
1992
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
125
click to vote
EC
2006
15 years 4 months ago
2006
Genetic programming has highlighted the problem of bloat, the uncontrolled growth of the average size of an individual in the population. The most common approach to dealing with ...
126
Voted
COMGEO
2007
ACM
15 years 4 months ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
115
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
251
Voted
CANDC
2005
ACM
15 years 4 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...