Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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
  • The probably approximately correct (PAC) population size of a genetic algorithm

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

    Probably approximately correct learning, PAC-learning, is a framework for the study of learnability and learning machines. In this framework, learning is induced through a set of examples. The size of this set is such that with probability greater than 1-δ the learning machine shows an approximately correct behavior with error no greater than ε. The authors use the PAC framework to deri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm-based system for generating test programs for microprocessor IP cores

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

    The current digital systems design trend is quickly moving toward a design-and-reuse paradigm. In particular, intellectual property cores are becoming widely used. Since the cores are usually provided as encrypted gate-level netlist, they raise several testability problems. The authors propose an automatic approach targeting processor cores that, by resorting to genetic algorithms, computes a test... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge based system: an object case approach

    Publication Year: 2000, Page(s):190 - 193
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    We propose an object based system to represent domain knowledge and to store it in libraries for reuse, following a case based paradigm. Our tool is generic enough to model any problem which requires a legal qualification. This kind of problem requires cooperation between several knowledge domains (e.g., medical practice and legal evaluation). The proposed case model captures the necessary expert'... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What's new? Using prior models as a measure of novelty in knowledge discovery

    Publication Year: 2000, Page(s):86 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    One of the challenges of knowledge discovery is identifying patterns that are interesting, with novelty an important component of interestingness. Another important aspect of knowledge discovery is making efficient use of background knowledge. This paper develops a definition of novelty relative to a prior model of the domain. The definition of novelty is tested using pneumonia outcome data and a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tools for intelligent decision support system development in the legal domain

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

    We describe tools that are particularly suited to the development of knowledge based systems in the domain of law. The first tool is a conceptual model that supports the categorization of legal tasks. Once categorized, tasks can be mapped onto to the most appropriate artificial reasoning model (if any) for computer based implementation. This scheme is based on theoretical and cultural perspectives... 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.
  • 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.
  • From data mining to rule refining. A new tool for post data mining rule optimisation

    Publication Year: 2000, Page(s):82 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The discovery of information from data and its presentation to the user have long been the primary goals of data mining. This paper describes a new software tool, the Rule Refiner, which focuses on post data mining operations, the optimisation of rules, the visualisation of rule characteristics and their validity within domain data. The system also provides facilities for the manipulation of this ... 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.
  • Debugging knowledge-based applications with a generic toolkit

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

    Knowledge refinement tools assist in the debugging and maintenance of knowledge based systems (KBSs) by attempting to identify and correct faults in the knowledge that account for incorrect problem-solving. Most refinement systems target a single shell and are able to refine only KBSs implemented in this shell. Our KRUSTWorks toolkit is unusual in that it provides refinement facilities that can be... 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.
  • DGPS/INS integration using neural network methodology

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

    This paper presents an INS/DGPS land vehicle navigation system using a neural network methodology. The network setup is developed based on a mathematical model to avoid excessive training. The proposed method uses a KF-based backpropagation training rule, which achieves the optimal training criterion. The North and East travel distances are used as desired targets to train the two decoupled neural... 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.
  • Using latent semantic analysis to identify similarities in source code to support program understanding

    Publication Year: 2000, Page(s):46 - 53
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The paper describes the results of applying Latent Semantic Analysis (LSA), an advanced information retrieval method, to program source code and associated documentation. Latent semantic analysis is a corpus based statistical method for inducing and representing aspects of the meanings of words and passages (of natural language) reflective in their usage. This methodology is assessed for applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Principles for mining summaries using objective measures of interestingness

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

    An important problem in the area of data mining is the development of effective measures of interestingness for ranking discovered knowledge. The authors propose five principles that any measure must satisfy to be considered useful for ranking the interestingness of summaries generated from databases. We investigate the problem within the context of summarizing a single dataset which can be genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive generalization of a translation example using queries based on a semantic hierarchy

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

    This paper addresses the issue of acquiring translation rules for machine translation (MT) systems that adopt a transfer approach. These rules are semantic pattern pairs (SPPs) of source and target languages. Practical MT systems must additionally contain a huge number of SPPs corresponding to rarely-used predicates and predicate usages. Such SPPs are difficult to automatically acquire with corpus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpretation of self-organizing maps with fuzzy rules

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

    Exploration of large and high-dimensional data sets is one of the main problems in data analysis. Self-organizing maps (SOMs) can be used to map large data sets to a simpler; usually two-dimensional topological structure. This mapping is able to illustrate dependencies in the data in a very intuitive manner and allows fast location of clusters. However because of the black-box design of neural net... 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.
  • 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.
  • Model selection via meta-learning: a comparative study

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

    The selection of an appropriate inducer is crucial for performing effective classification. In previous work we presented a system called NOEMON which relied on a mapping between dataset characteristics and inducer performance to propose inducers for specific datasets. Instance based learning was used to create that mapping. Here we extend and refine the set of data characteristics; we also use a ... View full abstract»

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