Sciweavers

3422 search results - page 477 / 685
» Random Subset Optimization
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 9 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
PROVSEC
2007
Springer
15 years 9 months ago
Decryptable Searchable Encryption
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This pa...
Thomas Fuhr, Pascal Paillier
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
15 years 9 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
115
Voted
FOCS
2006
IEEE
15 years 9 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
ICMCS
2006
IEEE
100views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Distributed Media Rate Allocation in Overlay Networks
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
Dan Jurca, Pascal Frossard