Sciweavers

2634 search results - page 74 / 527
» Faster Than Uppaal
Sort
View
CPAIOR
2010
Springer
14 years 1 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
14 years 1 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
EUROCRYPT
2001
Springer
14 years 1 months ago
Cryptanalysis of Reduced-Round MISTY
Abstract. The block ciphers MISTY1 and MISTY2 proposed by Matsui are based on the principle of provable security against differential and linear cryptanalysis. This paper presents...
Ulrich Kühn
ICANN
2001
Springer
14 years 1 months ago
Fast Curvature Matrix-Vector Products
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
Nicol N. Schraudolph
MICCAI
2001
Springer
14 years 1 months ago
Shape Preserving Filament Enhancement Filtering
Abstract. Morphological connected set filters for extraction of filamentous details from medical images are developed. The advantages of these filters are that they are shape pr...
Michael H. F. Wilkinson, Michel A. Westenberg