680 search results - page 13 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
IEEECIT
2005
IEEE
14 years 1 months ago
2005
IEEE
Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that co...
AAAI
2006
13 years 9 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
TSP
2008
13 years 7 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
FDG
2009
ACM
14 years 2 months ago
2009
ACM
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
ISSAC
1998
Springer
14 years 2 hour ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...