1220 search results - page 135 / 244 » Dependent classes |
134
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
141
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper studies a general class of formations of unicycle robots. One of the robots plays the role of the leader and the formation is induced through a constraint function F tha...
149
click to vote
ECCC
2011
14 years 10 months ago
2011
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
128
click to vote
MCM
2011
14 years 10 months ago
2011
We consider a polymerization (fragmentation) model with size-dependent parameters involved in prion proliferation. Using power laws for the different rates of this model, we reco...
145
click to vote
SIAMJO
2010
14 years 10 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...