9572 search results - page 429 / 1915 » Cover Algorithms and Their Combination |
242
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
227
click to vote
CPAIOR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
155
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...
195
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
151
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...