14518 search results - page 117 / 2904 » Two Problems for Sophistication |
JACM
2006
13 years 10 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
TIME
1994
IEEE
14 years 2 months ago
1994
IEEE
The frame problem was originally de ned in the context of the situation calculus. The problem also manifests itself in more sophisticated temporal logics that can represent interv...
ISPASS
2010
IEEE
14 years 5 months ago
2010
IEEE
After many years of prefetching research, most commercially available systems support only two types of prefetching: software-directed prefetching and hardware-based prefetchers u...
ALGORITHMICA
2010
13 years 10 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...