395 search results - page 15 / 79 » Positive Versions of Polynomial Time |
FORMATS
2004
Springer
15 years 1 months ago
2004
Springer
The hierarchy of untimed equivalences is well understood for action-based systems. This is not the case for timed systems, where it is, for example, possible to detect concurrency ...
ASPDAC
2010
ACM
14 years 7 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
112
click to vote
CPM
1995
Springer
15 years 1 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
AAAI
2010
14 years 11 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...