Sciweavers

3368 search results - page 569 / 674
» The Complexity of Query Reliability
Sort
View
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
LPAR
2004
Springer
14 years 3 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
POLICY
2004
Springer
14 years 3 months ago
Cassandra: Distributed Access Control Policies with Tunable Expressiveness
We study the specification of access control policy in large-scale distributed systems. Our work on real-world policies has shown that standard policy idioms such as role hierarc...
Moritz Y. Becker, Peter Sewell
HICSS
2003
IEEE
127views Biometrics» more  HICSS 2003»
14 years 3 months ago
Storage Model for CDA Documents
The Health Level 7 Clinic Document Architecture (CDA) is an XML-based document markup standard that specifies the hierarchical structure and semantics of “clinical documents” ...
Zheng Liang, Peter Bodorik, Michael Shepher