Sciweavers

281 search results - page 23 / 57
» Planning with Partial Preference Models
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 9 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
ATAL
2006
Springer
14 years 6 days ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
JAIR
2007
118views more  JAIR 2007»
13 years 8 months ago
Individual and Domain Adaptation in Sentence Planning for Dialogue
One of the biggest challenges in the development and deployment of spoken dialogue systems is the design of the spoken language generation module. This challenge arises from the n...
Marilyn A. Walker, Amanda Stent, François M...
AAAI
2010
13 years 10 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
WSC
2004
13 years 9 months ago
Simulating Availability Outlook for E-Commerce Business of Personal Computer Sales
For newly designed or transformed business processes, accurately predicting business performances such as costs and customer services before actual deployment is very important. W...
Young M. Lee