753 search results - page 14 / 151 » Completing a (k - 1)-Assignment |
169
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
COR
2007
14 years 9 months ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
TPDS
2002
14 years 9 months ago
2002
ECCC
2010
14 years 4 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.