1232 search results - page 31 / 247 » Digraphs: theory, algorithms and applications |
108
click to vote
KI
2001
Springer
15 years 6 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
104
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
130
click to vote
SACI
2007
IEEE
15 years 8 months ago
2007
IEEE
: Linear Parameter Varying(LPV) systems appear in a form of LTI state space representations where the elements of the A(ρ), B(ρ), C(ρ) matrices can depend on an unknown but at a...
145
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
127
click to vote
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...