2446 search results - page 174 / 490 » Choiceless Polynomial Time |
124
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
122
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
108
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
119
click to vote
TCS
1998
15 years 3 months ago
1998
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
132
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...