1609 search results - page 13 / 322 » Problem Structure and Dependable Architecture |
IDEAL
2009
Springer
14 years 2 months ago
2009
Springer
Nowadays, there is a growing need for providing novel solutions to facilitate active learning in dependency environments. This paper present a multiagent architecture that incorpor...
FLAIRS
2009
13 years 5 months ago
2009
The predicates that are used to encode a planning domain in PDDL often do not include concepts that are important for effectively reasoning about problems in the domain. In partic...
IJCAI
2007
13 years 9 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
KDD
2008
ACM
14 years 8 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...