74 search results - page 7 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
STOC
2007
ACM
15 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
125
click to vote
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
111
click to vote
ILP
2004
Springer
15 years 2 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...