457 search results - page 50 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
174
click to vote
ECAI
2008
Springer
15 years 7 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
141
click to vote
FM
2008
Springer
15 years 7 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
147
click to vote
MP
2008
15 years 6 months ago
2008
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
157
click to vote
LOGCOM
2010
15 years 4 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
145
click to vote
TRANSCI
2011
15 years 1 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...