2446 search results - page 161 / 490 » Choiceless Polynomial Time |
101
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
213
Voted
RTAS
2011
IEEE
14 years 4 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
89
Voted
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
106
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
103
Voted
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...