Sciweavers

895 search results - page 113 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
KBSE
2007
IEEE
15 years 5 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
IHI
2010
169views Healthcare» more  IHI 2010»
14 years 5 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
ICML
2004
IEEE
15 years 11 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
CEC
2007
IEEE
15 years 5 months ago
NEMO: neural enhancement for multiobjective optimization
— In this paper, a neural network approach is presented to expand the Pareto-optimal front for multiobjective optimization problems. The network is trained using results obtained...
Aaron Garrett, Gerry V. Dozier, Kalyanmoy Deb
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
15 years 8 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu