Sciweavers

4757 search results - page 821 / 952
» Monads for Functional Programming
Sort
View
115
Voted
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 7 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
137
Voted
REX
1991
15 years 7 months ago
From Timed to Hybrid Systems
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
Oded Maler, Zohar Manna, Amir Pnueli
125
Voted
SIGGRAPH
1987
ACM
15 years 7 months ago
Generating antialiased images at low sampling densities
Ray tracing produces point samples of an image from a 3-D model. Constructing an antialiased digital picture from point samples is difficult without resorting to extremely high sa...
Don P. Mitchell
133
Voted
CISIS
2010
IEEE
15 years 7 months ago
Automatic Offloading of C++ for the Cell BE Processor: A Case Study Using Offload
Offload C++ is an extended version of the C++ language, together with a compiler and runtime system, for automatically offloading general-purpose C++ code to run on the Synergistic...
Alastair F. Donaldson, Uwe Dolinsky, Andrew Richar...
CNHPCA
2009
Springer
15 years 7 months ago
Parallel Branch Prediction on GPU Platform
Abstract. Branch Prediction is a common function in nowadays microprocessor. Branch predictor is duplicated into multiple copies in each core of a multicore and many-core processor...
Liqiang He, Guangyong Zhang