5624 search results - page 198 / 1125 » On Conditional Covering Problem |
175
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
165
click to vote
MA
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
177
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
158
click to vote
ITS
2010
Springer
15 years 11 months ago
2010
Springer
In a controlled experiment using Comrade, a computer-supported peer review system, student reviewers offered feedback to student authors on their written analyses of a problem scen...
175
click to vote
AAAI
1996
15 years 7 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...