Sciweavers

1068 search results - page 120 / 214
» Group Dominant Strategies
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
GROUP
2010
ACM
15 years 4 months ago
Coordination by avoidance: bringing things together and keeping them apart across hospital departments
Coordination is central in CSCW systems design, where it is often considered as a process of bringing artifacts and activities together and making them part of a larger system. In...
Naja Holten Møller, Paul Dourish
CEE
2007
107views more  CEE 2007»
15 years 6 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
DAC
2009
ACM
16 years 7 months ago
Online cache state dumping for processor debug
Post-silicon processor debugging is frequently carried out in a loop consisting of several iterations of the following two key steps: (i) processor execution for some duration, fo...
Anant Vishnoi, Preeti Ranjan Panda, M. Balakrishna...
CCS
2009
ACM
16 years 7 months ago
Automating analysis of large-scale botnet probing events
Botnets dominate today's attack landscape. In this work we investigate ways to analyze collections of malicious probing traffic in order to understand the significance of lar...
Zhichun Li, Anup Goyal, Yan Chen, Vern Paxson