Sciweavers

2834 search results - page 548 / 567
» Representing Trees with Constraints
Sort
View
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 1 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
KBSE
2005
IEEE
14 years 28 days ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...
PLDI
2005
ACM
14 years 27 days ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
COLT
2005
Springer
14 years 26 days ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
GI
2005
Springer
14 years 26 days ago
Distributed User Modeling for Situated Interaction
: A distributed service to model and control contextual information in mobile and ubiquitous computing environments is presented in this paper. We introduce the general user model ...
Dominik Heckmann