725 search results - page 110 / 145 » heuristics 2010 |
98
Voted
NETWORKS
2010
14 years 11 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
104
Voted
NN
2010
Springer
14 years 11 months ago
2010
Springer
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
104
Voted
OOPSLA
2010
Springer
14 years 11 months ago
2010
Springer
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
110
click to vote
TCOM
2010
14 years 10 months ago
2010
Abstract—In packet communication systems, a header is attached to the transmitted packet at each layer. The overhead due to the transmission of the individual header can have a s...