Sciweavers

14386 search results - page 365 / 2878
» The Chinese Generals Problem
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 7 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 1 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
16 years 10 days ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi