Sciweavers

728 search results - page 65 / 146
» Bargaining with incomplete information
Sort
View
ECAI
1992
Springer
13 years 11 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
ECOWS
2006
Springer
13 years 9 months ago
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
Jyotishman Pathak, Samik Basu, Robyn R. Lutz, Vasa...
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
13 years 9 months ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
13 years 2 months ago
Observational learning in an uncertain world
We study a model of observational learning in social networks in the presence of uncertainty about agents' type distributions. Each individual receives a private noisy signal ...
Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdag...