Sciweavers

1486 search results - page 124 / 298
» Algorithms for two-box covering
Sort
View
DLT
2006
15 years 5 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
JAL
2006
175views more  JAL 2006»
15 years 4 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin

Book
5381views
17 years 3 months ago
Image Processing in C
"This book is a tutorial on image processing. Each chapter explains basic concepts with words and gures, shows image processing results with photographs, and implements the...
D. Phillips

Tutorial
1525views
17 years 3 months ago
Markov Chain Monte Carlo
This tutorial was held within the Maths Club at the University of Leeds Topics covered (briefly): Monte Carlo Integration Markov Chain Markov Chain Monte Carlo Sampling Metrop...
Dima Damen
ICTAC
2004
Springer
15 years 9 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik