Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000

15-15 Nov. 2000

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings 12th IEEE Internationals Conference On Tools With Artificial Intelligence

    Publication Year: 2000, Page(s):iii - ix
    Request permission for commercial reuse | PDF file iconPDF (305 KB)
    Freely Available from IEEE
  • Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (878 KB)
    Freely Available from IEEE
  • About the use of local consistency in solving CSPs

    Publication Year: 2000, Page(s):104 - 107
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB)

    Local consistency is often a suitable paradigm for solving constraint satisfaction problems. We show how search algorithms could be improved, thanks to a smart use of two filtering techniques (path consistency and singleton arc consistency). We propose a possible way to get benefits from using a partial form of path consistency (PC) during the search. We show how local treatment based on singleton... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent content-based retrieval

    Publication Year: 2000, Page(s):262 - 265
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This paper deals with the challenge of extending classical image retrieval by including visual rules. The visual rules are extracted automatically from classes of images. They contribute to making the retrieval process more accurate. The visual-rules extraction is based on symbolic representations of image descriptors. The symbolic representations are the results of color and texture clustering. View full abstract»

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

    Publication Year: 2000, Page(s):426 - 427
    Request permission for commercial reuse | PDF file iconPDF (111 KB)
    Freely Available from IEEE
  • Meta-constraints on violations for over constrained problems

    Publication Year: 2000, Page(s):358 - 365
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Constraint programming techniques are widely used to solve real-world problems. It often happens that such problems are over-constrained and do not have any solution. In such a case, the goal is to find a good compromise. A simple theoretical framework is the Max-CSP, where the goal is to minimize the number of constraint violations. However, in real-life problems, complex rules are generally impo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Bayesian classifier in relevant feedback of image retrieval

    Publication Year: 2000, Page(s):258 - 261
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    Relevance feedback is a powerful technique in content-based image retrieval (CBIR) and has been an active research area for the past few years. In this paper, we propose a new relevance feedback approach based on a Bayesian classifier, and it treats positive and negative feedback examples with different strategies. For positive examples, a Bayesian classifier is used to determine the distribution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reactive method for real time dynamic vehicle routing problem

    Publication Year: 2000, Page(s):176 - 180
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The real time dynamic vehicle routing problem (RT-DVRP) is an extension of VRPTW, in which the problem parameters change in real time. We present a solution to RTDVRP: a concurrent, agent-based reactive vehicle routing system (RVRS) and the implementation of the RVRS, which combines a generic, concurrent infrastructure and a powerful incremental local optimization heuristic View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support based measures applied to ice hockey scoring summaries

    Publication Year: 2000, Page(s):352 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    We present the hockey line extraction (HLE) algorithm, which examines ice hockey scoring summaries in an attempt to determine a team's lines. The players on a hockey team are divided into units called “lines” that appear together on the ice. The HLE algorithm uses single link clustering, support based measures and positional information to identify lines of players. The hockey lines so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object tracking and multimedia augmented transition network for video indexing and modeling

    Publication Year: 2000, Page(s):250 - 257
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    S.C. Chen et al. (1999) proposed a multimedia augmented transition network (ATN) model, together with its multimedia input strings, to model and structure video data. This multimedia ATN model was based on an ATN model that had been used within the artificial intelligence (AI) arena for natural-language understanding systems, and its inputs were modeled by multimedia input strings. The temporal an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing a learning-automata-based controller for client/server systems: a methodology

    Publication Year: 2000, Page(s):422 - 425
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    A client/server model which employs a polling policy as its access strategy is considered. We propose a learning-automata-based approach for polling in order to improve the throughput-delay performance of the system. Each client has an associated queue and the server performs selective polling such that the next client to be served is identified by a learning automaton. The learning automaton upda... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying causal structure in a biological neural network

    Publication Year: 2000, Page(s):126 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    A simulator for the Burgess, Recce, and O'Keefe (1994) BRO model of rodent navigation was built. Initial experiments did not reproduce the navigation performance reported by BRO. To determine the cause of the discrepancy, we reconstructed and reanalyzed their model. We were able to verify their main claim that if phase-modulated place cells act as radial basis functions, then they computationally ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristics for the exam scheduling problem

    Publication Year: 2000, Page(s):172 - 175
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    As part of the process of creating a campus-wide timetabling system for the National University of Singapore, the authors investigated examination-scheduling algorithms. The challenge in exam scheduling is to draw up the final examination timetable, taking into account a number of different constraints. The authors propose a different approach when the interexamination gaps (termed paper spread) o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining models across algorithms and samples for improved results

    Publication Year: 2000, Page(s):344 - 351
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    Multiple approaches have been developed for improving predictive performance of a system by creating and combining various learned models. There are two main approaches to creating model ensembles. The first is to create a set of learned models by applying an algorithm repeatedly to different training sample data, while the second approach applies various learning algorithms to the same sample dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-optimising CBR retrieval

    Publication Year: 2000, Page(s):376 - 383
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    One reason why Case-Based Reasoning (CBR) has become popular is because it reduces development cost compared to rule-based expert systems. Still, the knowledge engineering effort may be demanding. In this paper we present a tool which helps to reduce the knowledge acquisition effort for building a typical CBR retrieval stage consisting of a decision-tree index and similarity measure. We use geneti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective retrieval of object pose from video

    Publication Year: 2000, Page(s):242 - 249
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Introduces a novel approach for rigid object pose estimation. The system rotates a reference frame of the object of interest until it reaches a view at which the rotated reference view and the unknown-pose view seem to be “similar”. A number of pose similarity measures were tested for different types of objects undergoing various amounts of rotation from the reference pose. We demonstr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The application of a machine learning tool to the validation of an air traffic control domain theory

    Publication Year: 2000, Page(s):414 - 421
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    In this paper we describe a project (IMPRESS) which utilised a machine learning tool for the validation of an air traffic control domain theory. During the project, novel techniques were devised for the automated revision of general clause form theories using training examples. This technique involves focusing in on the parts of a theory which involve ordinal sorts, and applying geometrical revisi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing an action language using a SAT solver

    Publication Year: 2000, Page(s):96 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    In recent years, research on planning algorithms has made big progress. Recent approaches encode the plan search space into a data structure called the planning graph. To extract plans, a planning graph is transformed into the satisfiability problem (SAT), which is solved by a high-speed SAT solver. This kind of planning is called SAT planning. On the other hand, recent research on reasoning about... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization tool for interactive learning of large decision trees

    Publication Year: 2000, Page(s):28 - 35
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Decision tree induction is certainly among the most applicable learning techniques due to its power and simplicity. However learning decision trees from large datasets, particularly in data mining, is quite different from learning from small or moderately sized datasets. When learning from large datasets, decision tree induction programs often produce very large trees. How to efficiently visualize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient prediction of interconnect crosstalk using neural networks

    Publication Year: 2000, Page(s):122 - 125
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Interconnect crosstalk prediction has become increasingly important with deep submicron downscaling of ICs and wafer scale integration. Existing tools for management of the emi problem are computationally expensive and not very broad in application. The unique approach proposed involves the creation of parameterized models of primitive interconnect structures, wirecells, using modular artificial n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about numeric and symbolic time information

    Publication Year: 2000, Page(s):164 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    Many applications such as planning, scheduling and natural language processing involve managing both symbolic and numeric aspects of time. We have developed a temporal model, TemPro, based on interval algebra, to express such applications in terms of qualitative and quantitative temporal constraints. TemPro extends the interval algebra relations of Allen (1983) to handle numeric information. To so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristic search based factoring tool

    Publication Year: 2000, Page(s):298 - 301
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Factoring is believed to be a difficult task. Although factoring is of interest in its own right, the security of RSA cryptography, among other cryptographic systems, is dependent on the difficulty of factoring the product of large primes. We show how to cast the problem of factoring integers as a state-based search to which the techniques of AI may be applied. Using small primes as operators, goa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency checking for Euclidean spatial constraints: a dimension graph approach

    Publication Year: 2000, Page(s):333 - 342
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial constraints among objects. The basic idea is to project the spatial constraints on both X and Y dimensions, and to construct a dimension graph on each dimension. Using a dimension graph representation transforms the problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cognitively adequate modelling of spatial reference in human-robot interaction

    Publication Year: 2000, Page(s):222 - 228
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The question addressed in this paper is which types of spatial reference human users employ in their interaction with a robot and how a cognitively adequate model of these strategies can be implemented. Experiments in human-robot interaction were carried out which show how human users approach an artificial communication partner which was designed on the basis of empirical findings regarding spati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining various algorithms to solve the ship berthing problem

    Publication Year: 2000, Page(s):370 - 375
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The Ship Berthing Problem (SBP) belongs to the category of NP-complete problems. In this paper we discuss the methods of representing the SBP with the use of a directed acyclic graph and the use of a acyclic list to represent valid solutions for the SBP. We then propose and investigate the performance of several variants of the randomized local search, Tabu search and genetic algorithm for solving... View full abstract»

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