Sciweavers

1097 search results - page 63 / 220
» Boosting with incomplete information
Sort
View
KAIS
2007
95views more  KAIS 2007»
14 years 9 months ago
Handling non-canonical software requirements based on Annotated Predicate Calculus
Eliciting requirements for a proposed system inevitably involves the problem of handling undesirable information about customer’s needs, including inconsistency, vagueness, redun...
Kedian Mu, Zhi Jin, Ruqian Lu, Yan Peng
LOPSTR
2007
Springer
15 years 3 months ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...
VLDB
1992
ACM
101views Database» more  VLDB 1992»
15 years 1 months ago
Proclamation-Based Model for Cooperating Transactions
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
H. V. Jagadish, Oded Shmueli
UAI
2004
14 years 11 months ago
Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty
Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is n...
Nathanael Hyafil, Craig Boutilier
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 4 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet