Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence

3-8 Nov. 1997

Filter Results

Displaying Results 1 - 25 of 80
  • Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (401 KB)
    Freely Available from IEEE
  • W-ACE: a logic language for intelligent Internet programming

    Publication Year: 1997, Page(s):2 - 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1188 KB)

    The development of the World Wide Web (WWW) has been considerably delayed due to the excessive complexity of developing advanced and intelligent applications for the Internet. An average application may require the use of different languages, an in-depth understanding of various communication protocols and low-level communication mechanisms, etc. We propose a logic programming system, called W-ACE... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IGLUE: an instance-based learning system over lattice theory

    Publication Year: 1997, Page(s):75 - 76
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Concept learning is one of the most studied areas in machine learning. A lot of work in this domain deals with decision trees. In this paper, we are concerned with a different kind of technique based on Galois lattices or concept lattices. We present a new semilattice based system, IGLUE, that uses the entropy function with a tap-down approach to select concepts during the lattice construction. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using fuzzy logic in ITS-course generation

    Publication Year: 1997, Page(s):190 - 193
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB)

    Shows how fuzzy logic has been used in the course building process. This process is based on the curriculum modeling approach that we have proposed, and exploits several knowledge sources, such as target-public knowledge and training requirements. By using these parameters, a fuzzy algorithm generates a course which is adapted to the given target public that can produce the required knowledge. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 1997, Page(s):585 - 587
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Progress: an approach for defining and monitoring non deterministic design-to-time methods

    Publication Year: 1997, Page(s):502 - 507
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Guaranteed response time is one of the most important issues encountered in designing real time systems. The AI community has developed various approaches to solve this problem, e.g. anytime algorithms, approximate processing, design to time scheduling and progressive reasoning. All these approaches rely on a trade-off between run time and quality of results. In the framework of the ESPRIT project... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Java-based intelligent mobile agents for open system management

    Publication Year: 1997, Page(s):492 - 501
    Cited by:  Papers (5)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Traditional approaches for network and service management are not suitable for heterogeneous, rapidly changing and extending telecommunications environments. The paper discusses the use of Java based intelligent mobile agents in the field of open system management It first presents a Java based mobile agent platform supporting the mobile management agents. Based on the mobility framework, the pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An intelligent directory-assistance system using natural language processing and mapping

    Publication Year: 1997, Page(s):486 - 487
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A telephone directory assistance system has been developed that uses natural language processing and mapping to reduce the time an operator spends looking for requested information. Its address analysis function has an average response time of 0.15 s with 99% accuracy. Its map guidance function has a response time of about 3 s for 100 KB of map data. Its search expansion function decreases operato... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic approach to the attitude control of an inverted pendulum system

    Publication Year: 1997, Page(s):268 - 269
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    The authors present a genetic approach to the optimal linear quadratic regulator (LQR) problem. Design of the optimal LQR depends on choosing weighting matrices. One must carry out a trial-and-error process to choose the proper weighting matrices in general. It is not a trivial problem. They show a new possibility using a genetic algorithm (GA) to find the proper weighting matrices and hence to ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GA performance in a babel-like fitness landscape

    Publication Year: 1997, Page(s):357 - 366
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The performance of genetic algorithms (GAs) is studied under a babel-like fitness landscape, in which only a one bit sequence is significantly advantageous over the others. Under this landscape, the most dominant process to determine the GA performance is the creation of the advantageous sequence, and crossover facilitates the creation, thereby improving the GA performance. We first conduct a comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards individualized information navigation tools that adapt to user domain expertise

    Publication Year: 1997, Page(s):484 - 485
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    The navigation of information spaces can be accelerated by restructuring the ways in which the information space is presented to the user. Individuals with little expertise in the browsed subject benefit less from speedy access of material when fast access comes at the expense of the information being moved out of its original context and thereby rendered incoherent. To ensure that users with vary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy approaches to acquiring experimental knowledge in cultural algorithms

    Publication Year: 1997, Page(s):260 - 267
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    Self-adaptation has been widely used in evolutionary computational models. Angeline (1995) defines three distinct adaptive levels, which are: population, individual, and component level. Cultural algorithms have been shown to provide a framework in which to model self-adaptation at all of these levels. Te authors examine the role that different forms of knowledge can play in the self-adaptation pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward the optimization of a class of black box optimization algorithms

    Publication Year: 1997, Page(s):348 - 356
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Many black box optimization algorithms have sufficient flexibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: user-determined choices among alternative parameters, operations, and logic structures; and the algorithm-determined alternative paths chosen during the process of seeking a solution to a particular problem. We discuss t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedular++: scheduling with knowledge objects

    Publication Year: 1997, Page(s):480 - 483
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The paper presents a scheduling system, Schedular++, which integrates logic rules into the object oriented paradigm. Schedular++ demonstrates the application of knowledge objects to solve a scheduling problem. Telecom manages the telephone network across the entire country. To efficiently manage the network, many fault dispatch centres (FDC) are distributed across the country, and each FDC maintai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending EGENET with lazy constraint consistency

    Publication Year: 1997, Page(s):248 - 257
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Constraint satisfaction problems (CSPs) occur widely in real-life applications such as bin-packing, planning and scheduling. EGENET: a neural network simulator based on the min-conflict heuristic, has had remarkable success in solving hard CSPs such as hard graph-colouring problems. Consistency techniques such as arc consistency have been extensively used to improve the search behaviour of complet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented constraint programming environment NeMo+ and its applications

    Publication Year: 1997, Page(s):296 - 303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A constraint programming environment NeMo+, which is implemented on a base of a so-called subdefinite models approach is presented. Subdefinite models are a variety of constraint programming techniques. NeMo+ includes a high-level object-oriented declarative language for specification of data types and constraints. The method of subdefinite models is briefly reviewed in the first part of the paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tools and experiments for hybrid neuro-symbolic processing

    Publication Year: 1997, Page(s):338 - 345
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Symbolic and connectionist tools are widely used in the artificial intelligence (AI) domain. Both approaches report weaknesses to address the full range of capabilities required by this domain, and are often combined to overcome some limitations, but no extensive efforts have been done to give a wider view of the problem. More precisely, many ad hoc hybrid models were built from symbolic and conne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real time scheduling with Neurosched

    Publication Year: 1997, Page(s):478 - 479
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Most scheduling problems are NP hard. Therefore, heuristics and approximation algorithms must be used for large problems when timing constraints have to be addressed. Obviously these methods are of interest when they provide near optimal solutions and when computational complexity can be controlled. The paper presents such a method based on Hopfield neural networks. Scheduling problems are solved ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning maximal generalized decision rules via discretization, generalization and rough set feature selection

    Publication Year: 1997, Page(s):548 - 556
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    We present a method to mine maximal generalized decision rules from databases by integrating discretization, generalization and rough sets feature selection. Our method reduces the data horizontally and vertically. In the first phase, discretization and generalization are integrated and the numeric attributes are discretized into a few intervals. Primitive values of symbolic attributes are replace... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the particle swarm optimization technique to train a recurrent neural model

    Publication Year: 1997, Page(s):45 - 49
    Cited by:  Papers (35)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    We discuss the results of implementing an evolutionary learning technique entitled particle swarm optimization as described by Kennedy and Eberhart (1995). We present a number of results using this technique on a number of neural model architectures using the XOR problem and then conclude by applying it to a real problem-parsing natural language phrases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperation of LP solvers for solving MILPs

    Publication Year: 1997, Page(s):240 - 247
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A standard approach to solving mixed integer linear programs is to perform a global branch and bound search through all possible combinations. Due to the hardness of the problem, this search must be closely controlled by a constraint solver which uses constraints to prune the search space in an a priori way. In this paper, one defines a new domain reduction solver which uses in a cooperative way a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GA-based performance analysis of network protocols

    Publication Year: 1997, Page(s):118 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is able to achieve good results: formal techniques can discover some bugs but can be applied to over-simplified models, only; on the other hand, statistical techniques relying on simulation often fail to find some critical case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-oriented approach to visual databases

    Publication Year: 1997, Page(s):288 - 295
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    As the demand for virtual reality systems increases, a new approach is needed to meet the following requirements: a world consists of a large number of objects; a camera is allowed to move and a world should be displayed in near real-time depending on the position of the camera as well as the angle of its lens; and minimum effort should be needed when objects are moving. We satisfy these requireme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anytime reasoning in first-order logic

    Publication Year: 1997, Page(s):142 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    We propose a class of algorithms which gives best-effort answers to problems in first-order logic given a bound on the resources available for reasoning. The algorithms in this class generate and attempt to solve S1 and S3 approximations to the input problem, then use the results to determine the most likely solution to the input problem. We show that an algorithm in this cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A metalevel architecture for knowledge-based neural network design

    Publication Year: 1997, Page(s):331 - 337
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    In this paper, the term knowledge-based neural network (NN) design is used to refer to all efforts at exploiting prior knowledge in neural network configuration and training. A variety of techniques have been proposed for this purpose; SCANDAL provides a workbench for evaluating and integrating these techniques. After a quick overview of three main approaches to NN design, we describe SCANDALS mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.