Sciweavers

949 search results - page 102 / 190
» Theory of Constraints
Sort
View
96
Voted
HYBRID
1997
Springer
15 years 4 months ago
Robust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
BIRTHDAY
2007
Springer
15 years 4 months ago
Automating Verification of Cooperation, Control, and Design in Traffic Applications
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of c...
Werner Damm, Alfred Mikschl, Jens Oehlerking, Erns...
130
Voted
MP
2011
14 years 7 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very eï¬...
Alper Atamtürk, Vishnu Narayanan
96
Voted
SIGADA
2005
Springer
15 years 6 months ago
Experiences using SPARK in an undergraduate CS course
This paper describes experiences garnered while teaching a course on high integrity software using SPARK to a mix of junior and senior level undergraduates. The paper describes th...
Anthony S. Ruocco
84
Voted
TCOM
2008
67views more  TCOM 2008»
15 years 17 days ago
Robust Frequency Hopping for Interference and Fading Channels
Abstract--A robust frequency-hopping system with noncoherent detection, iterative turbo decoding and demodulation, and channel estimation is presented. The data modulation is the s...
Don J. Torrieri, Shi Cheng, Matthew C. Valenti