Sciweavers

3422 search results - page 77 / 685
» Random Subset Optimization
Sort
View
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
15 years 7 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
123
Voted
UAI
2004
15 years 3 months ago
Exponential Families for Conditional Random Fields
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
Yasemin Altun, Alexander J. Smola, Thomas Hofmann
CPC
2008
135views more  CPC 2008»
15 years 2 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
ECCC
2000
140views more  ECCC 2000»
15 years 2 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
CCS
2007
ACM
15 years 8 months ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...