2412 search results - page 6 / 483 » Which Problems Have Strongly Exponential Complexity |
CP
2009
Springer
14 years 9 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
DELFI
2006
13 years 10 months ago
2006
: Mobile learning has left the status of a new born child. It is time now to implement some structure into the complex and various activities by a framework presented in this paper...
JC
2007
13 years 8 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...