Sciweavers

5227 search results - page 849 / 1046
» Enterprise modeling using class and instance models
Sort
View
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 10 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
HYBRID
2001
Springer
15 years 10 months ago
Semi-decidable Synthesis for Triangular Hybrid Systems
Abstract. The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the imp...
Omid Shakernia, George J. Pappas, Shankar Sastry
ICPR
2000
IEEE
15 years 10 months ago
Generalized Non-Reducible Descriptors
This paper provides a generalization of non-reducible descriptors by extending the concept of distance between patterns of di erent classes. Generalized non-reducible descriptors ...
Ventzeslav Valev, Bülent Sankur, Petia Radeva
IPPS
2000
IEEE
15 years 10 months ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa
MTDT
2000
IEEE
137views Hardware» more  MTDT 2000»
15 years 10 months ago
Diagnostic Testing of Embedded Memories Based on Output Tracing
A new approach to diagnostic testing of embedded memories is presented which enables the design of tests that provide complete detection and distinguishing of all faults in a give...
Dirk Niggemeyer, Elizabeth M. Rudnick, Michael Red...