531 search results - page 14 / 107 » A Better Algorithm for Random k-SAT |
STOC
1994
ACM
13 years 12 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— Efï¬cient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Active learning is a generic approach to accelerate training of classiï¬ers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...