1089 search results - page 80 / 218 » Bounds on generalized Frobenius numbers |
157
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
143
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
140
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
140
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
201
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...