CAEPIA
2003
Springer
13 years 8 months ago
2003
Springer
CBR systems are normally used to assist experts in the resolution of problems. During the last few years, researchers have been working in the development of techniques to automate...
CAEPIA
2003
Springer
13 years 8 months ago
2003
Springer
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...
CAEPIA
2003
Springer
13 years 8 months ago
2003
Springer
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in th...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. In this paper, some new approaches to training set size reduction are presented. These schemes basically consist of defining a small number of prototypes that represent ...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
The development of software systems is a complex task that requires support techniques to guide the process and solve inconsistencies in its . In the agent paradigm, the use of soc...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...