Sciweavers

96 search results - page 15 / 20
» On the Complexity of Deciding Avoidability of Sets of Partia...
Sort
View
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
SIGADA
2001
Springer
14 years 2 days ago
Automating software module testing for FAA certification
Automatic software testing is gradually becoming accepted practice in the software industry. The shrinking development cycle and higher expectation of software quality are forcing...
Usha Santhanam
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 6 months ago
A New Sobolev Gradient Method for Direct Minimization of the Gross--Pitaevskii Energy with Rotation
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
Ionut Danaila, Parimah Kazemi
ECCV
2002
Springer
14 years 9 months ago
Visual Data Fusion for Objects Localization by Active Vision
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
François Chaumette, Grégory Flandin
ARTMED
2010
119views more  ARTMED 2010»
13 years 7 months ago
Fuzzy Arden Syntax: A fuzzy programming language for medicine
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
Thomas Vetterlein, Harald Mandl, Klaus-Peter Adlas...