Sciweavers

CP
1999
Springer
14 years 1 days ago
An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
CP
1999
Springer
14 years 1 days ago
Operational Equivalence of CHR Programs and Constraints
Slim Abdennadher, Thom W. Frühwirth
AUSAI
1999
Springer
14 years 1 days ago
Neurofuzzy Learning of Mobile Robot Behaviours
Richard Willgoss, Javaid Iqbal
AUSAI
1999
Springer
14 years 1 days ago
Minimal Belief Change and Pareto-Optimality
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
Oliver Schulte
AUSAI
1999
Springer
14 years 1 days ago
Computing Least Common Subsumers in Expressive Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
Thomas Mantay
AUSAI
1999
Springer
14 years 1 days ago
Feasibility of Optimised Disjunctive Reasoning for Approximate Matching
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
Ian Horrocks, Lin Padgham, Laura Thomson
AUSAI
1999
Springer
14 years 1 days ago
Generating Rule Sets from Model Trees
Model trees—decision trees with linear models at the leaf nodes—have recently emerged as an accurate method for numeric prediction that produces understandable models. However,...
Geoffrey Holmes, Mark Hall, Eibe Frank
AUSAI
1999
Springer
14 years 1 days ago
Q-Learning in Continuous State and Action Spaces
Abstract. Q-learning can be used to learn a control policy that maximises a scalar reward through interaction with the environment. Qlearning is commonly applied to problems with d...
Chris Gaskett, David Wettergreen, Alexander Zelins...
AUSAI
1999
Springer
14 years 1 days ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall