AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
In this paper, we propose a dynamic allocation method of basis functions, an Allocation/Elimination Gaussian Softmax Basis Function Network (AE-GSBFN), that is used in reinforcemen...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
How to assess the performance of machine learning algorithms is a problem of increasing interest and urgency as the data mining application of myriad algorithms grows. The standard...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
This paper presents a formal method based on the high-level semantics of processes to reason about continuous change. With a case study we show how the semantics of processes can b...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
The conversational agent understands and provides users with proper information based on natural language. Conventional agents based on pattern matching have much restriction to ma...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
AUSAI
2004
Springer
14 years 5 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...