Sciweavers

4171 search results - page 526 / 835
» Choice numbers of graphs
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Exploring the multiple-GPU design space
Graphics Processing Units (GPUs) have been growing in popularity due to their impressive processing capabilities, and with general purpose programming languages such as NVIDIA’s...
Dana Schaa, David R. Kaeli
LICS
2009
IEEE
16 years 1 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
16 years 1 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
BPM
2009
Springer
157views Business» more  BPM 2009»
16 years 1 months ago
An Evaluation Framework for Business Process Management Products
The number of BPM products available has increased substantially in the last years, so that choosing among these products became a difficult task for potential BPM users. This pape...
Stefan R. Koster, Maria-Eugenia Iacob, Luís...
ATAL
2009
Springer
16 years 1 months ago
Team competition
In a team competition, two participating teams have an equal number of players, and each team orders its players linearly based on their strengths. A mechanism then specifies how...
Pingzhong Tang, Yoav Shoham, Fangzhen Lin