2168 search results - page 374 / 434 » Randomized Algorithms and Complexity Theory |
137
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
121
Voted
SIGMETRICS
2005
ACM
15 years 8 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
93
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
134
Voted
INFORMATICALT
2006
15 years 2 months ago
2006
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
116
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...