Sciweavers

5180 search results - page 312 / 1036
» Concurrency, Time, and Constraints
Sort
View
COCOON
2001
Springer
15 years 11 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
ATS
2001
IEEE
137views Hardware» more  ATS 2001»
15 years 10 months ago
Compaction Schemes with Minimum Test Application Time
Testing embedded cores in a System-on-a-chip necessitates the use of a Test Access Mechanism, which provides for transportation of the test data between the chip and the core I/Os...
Ozgur Sinanoglu, Alex Orailoglu
AAAI
2007
15 years 9 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
CONCUR
2005
Springer
15 years 8 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael
FECS
2007
142views Education» more  FECS 2007»
15 years 8 months ago
Adding Some Lab Time is Good, Adding More Must be Better: the Benefits and Barriers to Lab-Centric Courses
: This paper examines the benefits that can arise from increased use of labs in computer science instruction. While some use of labs is widespread in the earliest computer science ...
Nathaniel Titterton, Michael J. Clancy