Sciweavers

33 search results - page 2 / 7
» fm 2003
Sort
View
FM
2003
Springer
89views Formal Methods» more  FM 2003»
13 years 10 months ago
Team Automata Satisfying Compositionality
A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation...
Maurice H. ter Beek, Jetty Kleijn
FM
2003
Springer
129views Formal Methods» more  FM 2003»
13 years 10 months ago
Trends in Software Verification
With the steady increase in computational power of general purpose computers, our ability to analyze routine software artifacts is also steadily increasing. As a result, we are wit...
Gerard J. Holzmann
IJCAI
2003
13 years 6 months ago
Combining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
Arathi Ramani, Igor L. Markov
ICPP
2003
IEEE
13 years 10 months ago
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane S...
HAPTICS
2003
IEEE
13 years 10 months ago
Motion Guidance Experiments with Scooter Cobot
Cobots assist humans by mechanically guiding motion along software-defined paths or surfaces. Cobot design has been extensively studied previously. This paper reports the first sy...
Eng Seng Boy, Etienne Burdet, Chee Leong Teo, Jame...