1301 search results - page 156 / 261 » Bounded Version Vectors |
ALGORITHMICA
2011
13 years 5 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
TCIAIG
2010
13 years 5 months ago
2010
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Training sequences for estimation of channel parameters have been well designed under the condition that the number of the unknown channel parameters is not greater than the numbe...
DLOG
2011
13 years 2 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...