2976 search results - page 107 / 596 » On the bounded integer programming |
107
click to vote
EUROPAR
1998
Springer
15 years 4 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
109
click to vote
AADEBUG
1997
Springer
15 years 4 months ago
1997
Springer
This paper presents a new approach to enforcing array bounds and pointer checking in the C language. Checking is rigorous in the sense that the result of pointer arithmetic must r...
88
Voted
IJCAI
2007
15 years 2 months ago
2007
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
104
Voted
COMPGEOM
1992
ACM
15 years 4 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
LCTRTS
2007
Springer
15 years 6 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...