16 search results - page 3 / 4 » Computing modular polynomials in quasi-linear time |
GECCO
2005
Springer
15 years 2 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
CP
1997
Springer
15 years 1 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
100
click to vote
KR
2010
Springer
15 years 2 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...