1224 search results - page 156 / 245 » Theory decision by decomposition |
106
click to vote
CHI
2010
ACM
15 years 7 months ago
2010
ACM
Interest has been growing within HCI on the use of machine learning and reasoning in applications to classify such hidden states as user intentions, based on observations. HCI res...
119
Voted
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
110
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
84
Voted
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
113
click to vote
ICPP
2007
IEEE
15 years 7 months ago
2007
IEEE
– Anonymous communication systems built on P2P infrastructures using anonymity forwarders are frequently affected by the churn problem, i.e. frequent joins and leaves of nodes. T...