14165 search results - page 607 / 2833 » The generalized two-server problem |
265
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
190
click to vote
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
16 years 1 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
178
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
188
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
175
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...