Results 11 - 20 of 350,786

Wrapper Induction for Information Extraction

by Nicholas Kushmerick , 1997
"... The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract - Cited by 612 (30 self) - Add to MetaCart
are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource's content. Unfortunately, hand-coding wrappers is tedious. We

Real-coded genetic algorithms, virtual alphabets, and blocking

by David E Goldberg , 1990
"... goldbergvmd cso uiuc edu This paper presents a theory of convergence for realcoded genetic algorithmsGAs that use oatingpoint or other highcardinality codings in their chromosomes The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance and r ..."
Abstract - Cited by 105 (7 self) - Add to MetaCart
goldbergvmd cso uiuc edu This paper presents a theory of convergence for realcoded genetic algorithmsGAs that use oatingpoint or other highcardinality codings in their chromosomes The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance

Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

by Eckart Zitzler, Lothar Thiele, Kalyanmoy Deb , 2000
"... In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in conver ..."
Abstract - Cited by 605 (39 self) - Add to MetaCart
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly

Fast Parallel Algorithms for Short-Range Molecular Dynamics

by Steve Plimpton - JOURNAL OF COMPUTATIONAL PHYSICS , 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract - Cited by 622 (6 self) - Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular

Inductive Learning Algorithms and Representations for Text Categorization

by Susan Dumais, John Platt, Mehran Sahami, David Heckerman , 1998
"... Text categorization – the assignment of natural language texts to one or more predefined categories based on their content – is an important component in many information organization and management tasks. We compare the effectiveness of five different automatic learning algorithms for text categori ..."
Abstract - Cited by 641 (8 self) - Add to MetaCart
Text categorization – the assignment of natural language texts to one or more predefined categories based on their content – is an important component in many information organization and management tasks. We compare the effectiveness of five different automatic learning algorithms for text

Predictive Models for the Breeder Genetic Algorithm -- I. Continuous Parameter Optimization

by Heinz Mühlenbein, Dirk Schlierkamp-Voosen - EVOLUTIONARY COMPUTATION , 1993
"... In this paper a new genetic algorithm called the Breeder Genetic Algorithm (BGA) is introduced. The BGA is based on artificial selection similar to that used by human breeders. A predictive model for the BGA is presented which is derived from quantitative genetics. The model is used to predict t ..."
Abstract - Cited by 395 (25 self) - Add to MetaCart
In this paper a new genetic algorithm called the Breeder Genetic Algorithm (BGA) is introduced. The BGA is based on artificial selection similar to that used by human breeders. A predictive model for the BGA is presented which is derived from quantitative genetics. The model is used to predict

Particle swarm optimization

by James Kennedy, Russell Eberhart , 1995
"... eberhart @ engr.iupui.edu A concept for the optimization of nonlinear functions using particle swarm methodology is introduced. The evolution of several paradigms is outlined, and an implementation of one of the paradigms is discussed. Benchmark testing of the paradigm is described, and applications ..."
Abstract - Cited by 3535 (22 self) - Add to MetaCart
, and applications, including nonlinear function optimization and neural network training, are proposed. The relationships between particle swarm optimization and both artificial life and genetic algorithms are described, 1

A Niched Pareto Genetic Algorithm for Multiobjective Optimization

by Jeffrey Horn, Nicholas Nafpliotis, David E. Goldberg - IN PROCEEDINGS OF THE FIRST IEEE CONFERENCE ON EVOLUTIONARY COMPUTATION, IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE , 1994
"... Many, if not most, optimization problems have multiple objectives. Historically, multiple objectives have been combined ad hoc to form a scalar objective function, usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic a ..."
Abstract - Cited by 395 (6 self) - Add to MetaCart
algorithm (GA), however, is readily modified to deal with multiple objectives by incorporating the concept of Pareto domination in its selection operator, and applying a niching pressure to spread its population out along the Pareto optimal tradeoff surface. We introduce the Niched Pareto GA as an algorithm

Gradual distributed real-coded genetic algorithms

by Francisco Herrera, Manuel Lozano - 151 Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs , 1999
"... Abstract—A major problem in the use of genetic algorithms is premature convergence, a premature stagnation of the search caused by the lack of diversity in the population. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, s ..."
Abstract - Cited by 58 (7 self) - Add to MetaCart
. Using crossover operators presented for real-coded genetic algorithms, we implement three instances of gradual distributed real-coded genetic algorithms. Experimental results show that the proposals consistently outperform sequential real-coded genetic algorithms and homogeneous distributed realcoded

FAST VOLUME RENDERING USING A SHEAR-WARP FACTORIZATION OF THE VIEWING TRANSFORMATION

by Philippe G. Lacroute , 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used brute-force techniques that req ..."
Abstract - Cited by 541 (2 self) - Add to MetaCart
family of volume rendering algorithms that reduces rendering times to one second. First we present a scanline-order volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanline-order algorithms are fundamentally more efficient than commonly-used ray
Results 11 - 20 of 350,786