Sciweavers

503 search results - page 68 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
IJCAI
1997
14 years 11 months ago
An Achievement Test for Knowledge-Based Systems: QUEM
This paper describes QUEM, a method for assessing the skill level of a knowledge-based system based on the quality of the solutions it produces. QUEM is demonstrated by using it t...
Caroline C. Hayes, Michael I. Parzen
CSL
2005
Springer
15 years 3 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
CONCUR
2007
Springer
15 years 1 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
HOTDEP
2008
107views Hardware» more  HOTDEP 2008»
15 years 2 days ago
Reverse-Engineering Drivers for Safety and Portability
Device drivers today lack two important properties: guaranteed safety and cross-platform portability. We present an approach to incrementally achieving these properties in drivers...
Vitaly Chipounov, George Candea
ICASSP
2007
IEEE
14 years 11 months ago
Variable Regularized Fast Affine Projections
This paper introduces a variable regularization method for the fast affine projection algorithm (VR-FAP). It is inspired by a recently introduced technique for variable regulariza...
Deepak Challa, Steven L. Grant, Asif Iqbal Mohamma...