10106 search results - page 1643 / 2022 » Algorithm Selection and Scheduling |
170
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
171
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
171
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
234
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
162
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...