406 search results - page 52 / 82 » Gadgets, Approximation, and Linear Programming |
134
click to vote
AAAI
2006
15 years 4 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
142
Voted
UAI
2004
15 years 4 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
116
Voted
TMC
2011
14 years 10 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
132
click to vote
RTSS
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
113
click to vote
NIPS
2008
15 years 4 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...