153 search results - page 29 / 31 » On an equivalence in discrete extremal problems |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
COMPGEOM
2010
ACM
13 years 12 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
CONCURRENCY
2010
13 years 4 months ago
2010
The faster growth curves in the speed of GPUs relative to CPUs in the past decade and its rapidly gained popularity have spawned a new area of development in computational technol...
CASES
2004
ACM
14 years 6 days ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...