526 search results - page 54 / 106 » Efficient Algorithms for Online Decision Problems |
129
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Web hosting providers are increasingly looking into dynamic hosting to reduce costs and improve the performance of their platforms. Instead of provisioning fixed resources to each...
134
click to vote
LCTRTS
2005
Springer
15 years 9 months ago
2005
Springer
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime i...
125
click to vote
TCS
2008
15 years 3 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
132
click to vote
NIPS
2000
15 years 5 months ago
2000
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
135
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...