4843 search results - page 455 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
MLDM
2008
Springer
15 years 5 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
155
click to vote
IJCSA
2007
15 years 5 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
123
click to vote
JDA
2007
15 years 5 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
147
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
145
click to vote
NECO
1998
15 years 4 months ago
1998
We derive solutions for the problem of missing and noisy data in nonlinear timeseries prediction from a probabilistic point of view. We discuss different approximations to the so...