789 search results - page 2 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
IAT
2009
IEEE
13 years 11 months ago
2009
IEEE
AAAI
2000
13 years 8 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
IGARSS
2009
13 years 5 months ago
2009
Many problems in remote sensing can be modeled as the minimization of the sum of a data term and a prior term. We propose to use a new complex wavelet based prior and an efficient...
COCO
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...