2370 search results - page 19 / 474 » A Structured Set of Higher-Order Problems |
BSL
2000
13 years 8 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
AAAI
2006
13 years 10 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
METMBS
2004
13 years 10 months ago
2004
Abstract One approach to predict the secondary structure of RNA is the comparative approach. This approach is used when alignment of several homologous sequences of a RNA is availa...