Sciweavers

2747 search results - page 248 / 550
» Non-oblivious Strategy Improvement
Sort
View
FLAIRS
2006
15 years 8 months ago
Adaptive, Confidence-Based Strategic Negotiations in Complex Multiagent Environments
We have designed and implemented an adaptive, confidence-based negotiation strategy for conducting multiple, concurrent negotiations among agents in dynamic, uncertain, and real-t...
Xin Li, Leen-Kiat Soh
NLUCS
2004
15 years 8 months ago
Making Cognitive Summarization Agents Work In A Real-World Domain
The advantage of cognitively motivated automatic summarizing is that human users can better understand what happens. This improves acceptability. The basic empirical finding in hum...
Brigitte Endres-Niggemeyer, Elisabeth Wansorra
OSDI
1994
ACM
15 years 8 months ago
Experiences with Locking in a NUMA Multiprocessor Operating System Kernel
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...
Ronald C. Unrau, Orran Krieger, Benjamin Gamsa, Mi...
IRREGULAR
1995
Springer
15 years 10 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
CIE
2008
Springer
15 years 8 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani