2168 search results - page 153 / 434 » Randomized Algorithms and Complexity Theory |
126
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
126
Voted
NN
2000
Springer
15 years 3 months ago
2000
Springer
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
131
click to vote
ISSAC
2001
Springer
15 years 7 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
112
click to vote
DEDS
2008
15 years 3 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
116
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...