395 search results - page 77 / 79 » Positive Versions of Polynomial Time |
AI
2007
Springer
14 years 10 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
JCO
2010
14 years 8 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
ISPD
2004
ACM
15 years 3 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...