1969 search results - page 195 / 394 » Financial Theory 1 |
161
click to vote
JCSS
2007
15 years 6 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
127
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
147
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. They cann...
139
click to vote
COMPLEXITY
2004
15 years 6 months ago
2004
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
172
click to vote
COLING
2002
15 years 6 months ago
2002
Cross-linguistic phoneme correspondences, or metaphonemes1 , can be defined across languages which are relatively closely related in exactly the same way as correspondences can be...