Sciweavers

2455 search results - page 412 / 491
» Learning Composite Concepts
Sort
View
SOFSEM
2007
Springer
15 years 10 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 10 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...
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
15 years 10 months ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb
GI
2004
Springer
15 years 10 months ago
Towards a Framework and a Design Methodology for Autonomic Integrated Systems
: The transition from microelectronics to nanoelectronics reaches physical limits and results in a paradigm shift in the design and fabrication of electronic circuits. The conserva...
Andreas Herkersdorf, Wolfgang Rosenstiel
COMPSAC
1997
IEEE
15 years 8 months ago
Classifying Architectural Elements as a Foundation for Mechanism Matching
Building a system at the architectural level can be thought of as decomposition into components followed by a series of exercises in matching. Components must be composed with eac...
Rick Kazman, Paul C. Clements, Leonard J. Bass, Gr...