Sciweavers

243 search results - page 34 / 49
» Learning Abstraction Hierarchies for Problem Solving
Sort
View
IPPS
1998
IEEE
14 years 28 days ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
CADE
2006
Springer
14 years 9 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
ECAI
2010
Springer
13 years 8 months ago
Learning to Author Text with textual CBR
Abstract. Textual reuse is an integral part of textual case-based reasoning (TCBR) which deals with solving new problems by reusing previous similar problem-solving experiences doc...
Ibrahim Adeyanju, Nirmalie Wiratunga, Juan A. Reci...
SCALESPACE
2009
Springer
14 years 3 months ago
Momentum Based Optimization Methods for Level Set Segmentation
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
Gunnar Läthén, Thord Andersson, Reiner...
CAV
1998
Springer
103views Hardware» more  CAV 1998»
14 years 27 days ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...