1920 search results - page 201 / 384 » The Complexity of the A B C Problem |
180
click to vote
STACS
1992
Springer
15 years 10 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
214
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
201
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
166
click to vote
COMPGEOM
2006
ACM
16 years 13 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
177
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...