Sciweavers

3357 search results - page 443 / 672
» Controlling Complexity
Sort
View
AGENTS
1997
Springer
15 years 10 months ago
TAIPE: Tactical Assistants for Interaction Planning and Execution
Downsizing the number of operators controlling complex systems can increase the decision-making demands on remaining operators, particularly in crisis situations. An answer to thi...
Edmund H. Durfee, Marcus J. Huber, Michael Kurnow,...
ASYNC
2004
IEEE
102views Hardware» more  ASYNC 2004»
15 years 10 months ago
Non-Uniform Access Asynchronous Register Files
Register files of microprocessors have often been cited as performance bottlenecks and significant consumers of energy. The robust and modular nature of quasi-delay insensitive (Q...
David Fang, Rajit Manohar
HPCA
1995
IEEE
15 years 10 months ago
Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems
—Reducing communication latency, which is a performance bottleneck in optically interconnected multiprocessor systems, is of prominent importance. A conventional approach for est...
Chunming Qiao, Rami G. Melhem
STACS
2010
Springer
16 years 1 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
ATAL
2009
Springer
16 years 1 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...