9842 search results - page 345 / 1969 » Problem complexity |
154
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
197
click to vote
IPPS
2003
IEEE
16 years 3 days ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
153
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
This article formalises the dual problem to model-based diagnosis (MBD), i.e., generating tests to isolate multiple simultaneous faults. Using a standard propositional MBD framewo...
152
click to vote
AIPS
2003
15 years 8 months ago
2003
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
167
click to vote
MP
2006
15 years 6 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...