Sciweavers

1380 search results - page 3 / 276
» Computing the optimal strategy to commit to
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
MICRO
2005
IEEE
105views Hardware» more  MICRO 2005»
13 years 10 months ago
Incremental Commit Groups for Non-Atomic Trace Processing
We introduce techniques to support efficient non-atomic execution of very long traces on a new binary translation based, x86-64 compatible VLIW microprocessor. Incrementally comm...
Matt T. Yourst, Kanad Ghose
ATAL
2008
Springer
13 years 7 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
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 follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ECP
1997
Springer
103views Robotics» more  ECP 1997»
13 years 9 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
EOR
2008
311views more  EOR 2008»
13 years 5 months ago
Optimal pricing, EOL (end of life) warranty, and spare parts manufacturing strategy amid product transition
We study firm's strategy to determine its product price and warranty period, and plan the spare parts manufacturing so as to maximize its profit and at the same time to fulfi...
Bowon Kim, Sangsun Park