Sciweavers

1628 search results - page 146 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
EACL
2009
ACL Anthology
15 years 1 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
KBSE
2007
IEEE
15 years 10 months ago
Nighthawk: a two-level genetic-random unit test data generator
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
James H. Andrews, Felix Chun Hang Li, Tim Menzies
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 10 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 8 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
IHI
2010
169views Healthcare» more  IHI 2010»
14 years 10 months ago
Dynamic scheduling of emergency department resources
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
Junchao Xiao, Leon J. Osterweil, Qing Wang