1995 search results - page 34 / 399 » What's the Problem |
149
Voted
COCO
1995
Springer
15 years 7 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
126
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
139
click to vote
TACAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
110
click to vote
SYNTHESE
2010
15 years 1 months ago
2010
In the Newcomb problem, the standard arguments for taking either one box or both boxes adduce what seem to be relevant considerations, but they are not complete arguments, and att...
142
Voted
DIS
2009
Springer
15 years 10 months ago
2009
Springer
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...