Sciweavers

232 search results - page 17 / 47
» Timed Commitments
Sort
View
AGENTS
2001
Springer
15 years 2 months ago
Principles of intention reconsideration
We present a framework that enables a belief-desire-intention (BDI) agent to dynamically choose its intention reconsideration policy in order to perform optimally in accordance wi...
Martijn C. Schut, Michael Wooldridge
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
AAAI
2008
15 years 1 days ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
SODA
2004
ACM
96views Algorithms» more  SODA 2004»
14 years 11 months ago
Non-migratory online deadline scheduling on multiprocessors
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
USENIX
1994
14 years 11 months ago
Improving the Write Performance of an NFS Server
The Network File System (NFS) utilizes a stateless protocol between clients and servers; the major advantage of this statelessness is that NFS crash recovery is very easy. However...
Chet Juszczak