Sciweavers

4378 search results - page 600 / 876
» On the Complexity of Ordered Colourings
Sort
View
SIGSOFT
2000
ACM
15 years 11 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 11 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
CC
2000
Springer
105views System Software» more  CC 2000»
15 years 11 months ago
MATOU: An Implementation of Mode-Automata
Mode-Automata have been proposed in [11]. They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of runn...
Florence Maraninchi, Yann Rémond, Yannick R...
ECAI
2000
Springer
15 years 11 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
ECBS
2010
IEEE
209views Hardware» more  ECBS 2010»
15 years 11 months ago
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
Lucas Cordeiro, Bernd Fischer 0002, João Ma...