Results 1 - 10 of 4,177

The Ant System: Optimization by a colony of cooperating agents

by Marco Dorigo, Vittorio Maniezzo, Alberto Colorni - IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS-PART B , 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract - Cited by 1300 (46 self) - Add to MetaCart
computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits

Evolving Reusable 3D Packing Heuristics with Genetic Programming

by Sam Allen, Edmund K. Burke, Matthew Hyde, Graham Kendall
"... This paper compares the quality of reusable heuristics designed by genetic programming (GP) to those designed by human programmers. The heuristics are designed for the three dimensional knapsack packing problem. Evolutionary computation has been employed many times to search for good quality solutio ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
search a space of heuristics, rather than directly searching a solution space. GP operates as a hyperheuristic in this paper, because it searches the space of heuristics that can be constructed from a given set of components. We show that GP can design simple, yet effective, stand-alone constructive

O-Plan: the Open Planning Architecture

by Ken Currie, Austin Tate , 1990
"... O-Plan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. O-Plan is a design and implementation of a more flexible s ..."
Abstract - Cited by 379 (41 self) - Add to MetaCart
system aimed at supporting planning research and development, opening up new planning methods and supporting strong search control heuristics. O-Plan takes an engineering approach to the construction of an efficient domain independent planning system which includes a mixture of AI and numerical

Automatically Generating Extraction Patterns from Untagged Text

by Ellen Riloff - Department of Computer Science, Graduate School of Arts and Science, New York University , 1996
"... Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input. ..."
Abstract - Cited by 373 (32 self) - Add to MetaCart
Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input

Conservation of resources: A new attempt at conceptualizing stress

by Stevan E. Hobfoll - American Psychologist , 1989
"... ABSTRACT: Major perspectives concerning stress are presented with the goal of clarifying the nature of what has proved to be a heuristic but vague construct. Current conceptualizations ofstress are challenged as being too phenomenological and ambiguous, and consequently, not given to direct empirica ..."
Abstract - Cited by 345 (3 self) - Add to MetaCart
ABSTRACT: Major perspectives concerning stress are presented with the goal of clarifying the nature of what has proved to be a heuristic but vague construct. Current conceptualizations ofstress are challenged as being too phenomenological and ambiguous, and consequently, not given to direct

Correlation-based feature selection for machine learning

by Mark A. Hall , 1998
"... A central problem in machine learning is identifying a representative set of features from which to construct a classification model for a particular task. This thesis addresses the problem of feature selection for machine learning through a correlation based approach. The central hypothesis is that ..."
Abstract - Cited by 318 (3 self) - Add to MetaCart
A central problem in machine learning is identifying a representative set of features from which to construct a classification model for a particular task. This thesis addresses the problem of feature selection for machine learning through a correlation based approach. The central hypothesis

Test pattern generation using Boolean satisfiability

by Tracy Larrabee - IEEE Transactions on Computer-Aided Design , 1992
"... Abstract-This article describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational circuits. This new method generates test patterns in two steps: First, it constructs a formula expressing the Boolean diference between the unfaulted and faulted ..."
Abstract - Cited by 306 (14 self) - Add to MetaCart
Abstract-This article describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational circuits. This new method generates test patterns in two steps: First, it constructs a formula expressing the Boolean diference between the unfaulted

Feature Subset Selection Using A Genetic Algorithm

by Jihoon Yang, Vasant Honavar , 1997
"... : Practical pattern classification and knowledge discovery problems require selection of a subset of attributes or features (from a much larger set) to represent the patterns to be classified. This is due to the fact that the performance of the classifier (usually induced by some learning algorithm) ..."
Abstract - Cited by 279 (7 self) - Add to MetaCart
) and the cost of classification are sensitive to the choice of the features used to construct the classifier. Exhaustive evaluation of possible feature subsets is usually infeasible in practice because of the large amount of computational effort required. Genetic algorithms, which belong to a class

Abstractions from Proofs

by Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Kenneth L. McMillan , 2004
"... The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationships between current values of variables, and only those which are req ..."
Abstract - Cited by 268 (33 self) - Add to MetaCart
are required for proving correctness. Previous methods for automatically refining predicate abstractions until sufficient precision is obtained do not systematically construct parsimonious abstractions: predicates usually contain symbolic variables, and are added heuristically and often uniformly to many
Results 1 - 10 of 4,177