1225 search results - page 207 / 245 » The Instance Complexity Conjecture |
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
WAN
1998
Springer
13 years 12 months ago
1998
Springer
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...
FM
1997
Springer
13 years 12 months ago
1997
Springer
: The widely accepted possible benefits of formal methods on the one hand and their minor use compared to informal or graphical description techniques on the other hand have repeat...
TIME
1994
IEEE
13 years 11 months ago
1994
IEEE
: In a dynamic, multi-agent environment, an the intelligent agents act as automated pilots automated intelligent agent is often faced with the for the simulated aircraft. These aut...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...