Sciweavers

636 search results - page 48 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
ECAI
2004
Springer
15 years 4 months ago
High-Level Observations in Java Debugging
Recent years have seen considerable developments in modeling techniques for automatic fault location in programs. However, much of this research considered the models from a standa...
Wolfgang Mayer, Markus Stumptner
ICAISC
2010
Springer
15 years 4 months ago
Quasi-parametric Recovery of Hammerstein System Nonlinearity by Smart Model Selection
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...
Zygmunt Hasiewicz, Grzegorz Mzyk, Przemyslaw Sliwi...
AAAI
1998
15 years 20 days ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
KI
2007
Springer
14 years 11 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
AI
1999
Springer
14 years 11 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...