8824 search results - page 95 / 1765 » On the Complexity of Real Functions |
135
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
158
click to vote
RTSS
1999
IEEE
15 years 8 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
127
click to vote
RTSS
1993
IEEE
15 years 8 months ago
1993
IEEE
This paper presents a technique that is capable of supporting two major requirements for concurrency control in real-time databases: data temporal consistency, and data logical co...
131
Voted
TNN
2008
15 years 4 months ago
2008
In this paper, we use complex analytic functions to achieve independent component analysis (ICA) by maximization of non-Gaussianity and introduce the complex maximization of nonGau...
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...