Sciweavers

1332 search results - page 211 / 267
» ideas 2008
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 11 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 11 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
COLT
2008
Springer
13 years 11 months ago
Teaching Dimensions based on Cooperative Learning
The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricksâ€...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...
GECCO
2008
Springer
174views Optimization» more  GECCO 2008»
13 years 11 months ago
Mask functions for the symbolic modeling of epistasis using genetic programming
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
Ryan J. Urbanowicz, Nate Barney, Bill C. White, Ja...
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
13 years 11 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana