Sciweavers

1350 search results - page 12 / 270
» Generalized Committed Choice
Sort
View
EUROSYS
2006
ACM
15 years 6 months ago
Tashkent: uniting durability with transaction ordering for high-performance scalable database replication
In stand-alone databases, the two functions of ordering the transaction commits and making the effects of transactions durable are generally performed in one action, namely in the...
Sameh Elnikety, Steven G. Dropsho, Fernando Pedone
JAIR
2011
103views more  JAIR 2011»
14 years 4 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
SEMWEB
2005
Springer
15 years 2 months ago
Modeling the Non-Expected Choice: A Weighted Utility Logit
This work derives and simulates two choice models applying the weighted utility theory, a generalization of the expected utility theory. It shows one set of assumptions, which jus...
Pia Koskenoja
ISIPTA
1999
IEEE
15 years 1 months ago
Treatment Choice Under Ambiguity Induced by Inferential Problems
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
Charles F. Manski
IEEEPACT
2008
IEEE
15 years 3 months ago
Scalable and reliable communication for hardware transactional memory
In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true ...
Seth H. Pugsley, Manu Awasthi, Niti Madan, Naveen ...