Sciweavers

71 search results - page 8 / 15
» Testing Boolean Function Isomorphism
Sort
View
IJCAI
1993
14 years 11 months ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba
FLAIRS
2009
14 years 7 months ago
Advanced Measures for Empirical Testing
Empirical testing is a very popular evaluation method for the development of intelligent systems. Here, previously solved problems with correct solutions are given as cases to the...
Joachim Baumeister
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 4 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CAISE
2006
Springer
15 years 1 months ago
Modelling and Verifying of e-Commerce Systems
Static function hierarchies and models of the dynamic behaviour are typically used in e-commerce systems. Issues to be verifies are the completeness and correctness of the static f...
Andreas Speck