Sciweavers

AI
2003
Springer
14 years 4 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle
AI
2003
Springer
14 years 4 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos
AI
2003
Springer
14 years 4 months ago
Enumerating the Preconditions of Agent Message Types
Agent communication languages (ACLs) invoke speech act theory and define individual message types by reference to particular combinations of beliefs and desires of the speaker (fea...
Francis Jeffry Pelletier, Renee Elio
AI
2003
Springer
14 years 4 months ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
AI
2003
Springer
14 years 4 months ago
Learning Coordination in RoboCupRescue
Abstract. In this abstract, we present a complex multiagent environment, the RoboCupRescue simulation, and show some of the learning opportunities for the coordination of agents in...
Sébastien Paquet
AI
2003
Springer
14 years 4 months ago
DIAGAL: A Tool for Analyzing and Modelling Commitment-Based Dialogues between Agents
Abstract. This paper overviews our currently in progress agent communication language simulator, called DIAGAL, by describing its use in analyzing and modelling automated conversat...
Marc-André Labrie, Brahim Chaib-draa, Nicol...
AI
2003
Springer
14 years 4 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
AI
2003
Springer
14 years 4 months ago
Answer Formulation for Question-Answering
In this paper, we describe our experimentations in answer formulation for question-answering (QA) systems. In the context of QA, answer formulation can serve two purposes: improvin...
Leila Kosseim, Luc Plamondon, Louis-Julien Guillem...
AI
2003
Springer
14 years 4 months ago
A Formal Theory for Describing Action Concepts in Terminological Knowledge Bases
This paper introduces a formal theory for describing actions in terminological knowledge bases, closely related to description logics. It deals in particular with the problem of ad...
Christel Kemke