331 search results - page 43 / 67 » HOLCF: Higher Order Logic of Computable Functions |
111
click to vote
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
: Traffic behavior in a large-scale network can be viewed as a complicated non-linear system, so it is very difficult to describe the long-term network traffic behavior in a large-...
114
Voted
SIAMIS
2010
14 years 7 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
105
Voted
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
105
Voted
LCTRTS
2005
Springer
15 years 6 months ago
2005
Springer
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
101
Voted
JGO
2010
14 years 7 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...