Sciweavers

1046 search results - page 13 / 210
» Approximation Algorithms for Domination Search
Sort
View
SEAL
2010
Springer
13 years 6 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
BMCBI
2006
95views more  BMCBI 2006»
13 years 8 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 1 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ALGORITHMICA
2011
13 years 3 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICCS
2009
Springer
14 years 3 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough