Sciweavers

1401 search results - page 92 / 281
» Cost-Sensitive Test Strategies
Sort
View
115
Voted
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 9 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
133
Voted
ICTAI
2003
IEEE
15 years 9 months ago
Engineering Optimization Using a Simple Evolutionary Algorithm
This paper presents a simple ¢¤£¦¥¨§© Evolution Strategy and three simple selection criteria to solve engineering optimization problems. This approach avoids the use of a...
Efrén Mezura-Montes, Carlos A. Coello Coell...
129
Voted
AIIA
2001
Springer
15 years 8 months ago
Wide Coverage Incremental Parsing by Learning Attachment Preferences
This paper presents a novel method for wide coverage parsing using an incremental strategy, which is psycholinguistically motivated. A recursive neural network is trained on treeba...
Fabrizio Costa, Vincenzo Lombardo, Paolo Frasconi,...
124
Voted
ICPP
1992
IEEE
15 years 7 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
107
Voted
ATAL
2006
Springer
15 years 7 months ago
A comparison between mechanisms for sequential compute resource auctions
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
Andrew Byde