7576 search results - page 152 / 1516 » UNIX as an Application Program |
160
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we describe a set of compiler analyses and an implementation that automatically map a sequential and un-annotated C program into a pipelined implementation, targete...
168
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
Run-time code generation is a well-known technique for improving the efficiency of programs by exploiting dynamic information. Unfortunately, the difficulty of constructing run-...
167
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
164
click to vote
ICTAI
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
142
click to vote
IFIP
1997
Springer
15 years 10 months ago
1997
Springer
This paper provides a conservative estimation of the required bandwidth for video sources multiplexed according to the bu erless scheme and using the Statistical Bit Rate transfer...