Sciweavers

1086 search results - page 135 / 218
» Jug measuring: Algorithms and complexity
Sort
View
EOR
2007
103views more  EOR 2007»
14 years 9 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
INLG
2010
Springer
14 years 7 months ago
Natural Reference to Objects in a Visual Domain
This paper discusses the basic structures necessary for the generation of reference to objects in a visual scene. We construct a study designed to elicit naturalistic referring ex...
Margaret Mitchell, Kees van Deemter, Ehud Reiter
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
FOCS
2008
IEEE
15 years 4 months ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
BMCBI
2007
128views more  BMCBI 2007»
14 years 9 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini