Sciweavers

1536 search results - page 12 / 308
» Approximately Dominating Representatives
Sort
View
CCCG
2010
13 years 9 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
SEAL
2010
Springer
13 years 5 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...
RSKT
2007
Springer
14 years 1 months ago
Optimized Generalized Decision in Dominance-Based Rough Set Approach
Dominance-based Rough Set Approach (DRSA) has been proposed to deal with multi-criteria classification problems, where data may be inconsistent with respect to the dominance princ...
Krzysztof Dembczynski, Salvatore Greco, Wojciech K...
ICDCS
2008
IEEE
14 years 2 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
AAAI
2010
13 years 9 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar