Sciweavers

8512 search results - page 1593 / 1703
» Computing Theory With Relevance
Sort
View
FCT
2005
Springer
14 years 1 months ago
The Maximum Resource Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
14 years 1 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
14 years 1 months ago
An artificial immune system algorithm for CDMA multiuser detection over multi-path channels
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
Maoguo Gong, Ling Wang, Licheng Jiao, Haifeng Du
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 1 months ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
ICALP
2005
Springer
14 years 1 months ago
Discrete Random Variables over Domains
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
Michael W. Mislove
« Prev « First page 1593 / 1703 Last » Next »