4839 search results - page 905 / 968 » A survey of computational complexity results in systems and ... |
116
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
109
click to vote
SC
1995
ACM
15 years 5 months ago
1995
ACM
Release consistency is a widely accepted memory model for distributed shared memory systems. Eager release consistency represents the state of the art in release consistent protoc...
122
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
113
click to vote
JSA
2000
15 years 1 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
114
click to vote
ICN
2009
Springer
15 years 8 months ago
2009
Springer
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...