Sciweavers

3898 search results - page 181 / 780
» On the Bit Extraction Problem
Sort
View
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 3 days ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
ATAL
2006
Springer
15 years 6 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes
MP
2006
138views more  MP 2006»
15 years 2 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
CISS
2011
IEEE
14 years 6 months ago
Secret key generation through OFDM multipath channel
—We analyze the fundamental limits of key generation and describe an implementation based on error correcting codes. We show that key extraction based on channel coefficients si...
Yanpei Liu, Stark C. Draper, Akbar M. Sayeed
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 6 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant