1686 search results - page 89 / 338 » Programs as polygraphs: computability and complexity |
ICCBR
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
101
click to vote
CP
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
UAI
2004
14 years 11 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
BROADNETS
2006
IEEE
15 years 3 months ago
2006
IEEE
—The central paradigm of today’s successful Internet is to keep the network core simple and move complexity towards the network end points. Unfortunately, this very paradigm li...
KRDB
2003
14 years 11 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...