- 2001
- Empirical Validation
of polyhedral projection schemes for Selected problems
in Network Optimization, Real-Time Scheduling and
Logic
Technical Report #2001-0009, WVU, CSEE
- A polynomial time algorithm
for a class of Quantified Integer Programs
Technical Report #2001-0007, WVU, CSEE
- A polynomial time decision procedure
for a class of Quantified Linear Programs
Technical Report #2001-0008, WVU, CSEE
- 2000
- On the parallel complexity
of Quantified 2SAT
Technical Report #2000-0001, WVU, CSEE
- On the complexity
of Parametric Scheduling
Technical Report #2000-0002, WVU, CSEE
- A Distributed Dispatching Scheme for
Parametric Schedulers
Technical Report #2000-0003, WVU, CSEE
- Parametric Scheduling for
Network Constraints
Technical Report #2000-0004, WVU, CSEE
- The E-T-C Scheduling Model: A
new framework
for the Specification of Real-Time Scheduling Problems
Technical Report #2000-0005, WVU, CSEE
- On the complexity of
Co-Static Scheduling
Technical Report #2000-0006, WVU, CSEE
|