Sciweavers

26354 search results - page 4950 / 5271
» How we refactor, and how we know it
Sort
View
APN
1992
Springer
15 years 10 months ago
Towards a Modular Analysis of Coloured Petri Nets
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
Søren Christensen, Laure Petrucci
VLDB
1994
ACM
126views Database» more  VLDB 1994»
15 years 10 months ago
Building a Laboratory Information System Around a C++-Based Object-Oriented DBMS
MapBase is a laboratory information system that has been supporting a high-throughput genome-mapping operation for the last three years. We chose to build MapBase around a C++-bas...
Nathan Goodman, Steve Rozen, Lincoln Stein
STACS
1992
Springer
15 years 10 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
ICML
1989
IEEE
15 years 10 months ago
Uncertainty Based Selection of Learning Experiences
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner&#...
Paul D. Scott, Shaul Markovitch
CASES
2007
ACM
15 years 10 months ago
SCCP/x: a compilation profile to support testing and verification of optimized code
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...
Raimund Kirner
« Prev « First page 4950 / 5271 Last » Next »