Sciweavers

2066 search results - page 202 / 414
» Component-Based Programming of Distributed Applications
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 6 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
PPOPP
2003
ACM
15 years 11 months ago
User-controllable coherence for high performance shared memory multiprocessors
In programming high performance applications, shared address-space platforms are preferable for fine-grained computation, while distributed address-space platforms are more suita...
Collin McCurdy, Charles N. Fischer
169
Voted
IPPS
2003
IEEE
15 years 11 months ago
Better Real-Time Response for Time-Share Scheduling
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
Scott A. Banachowski, Scott A. Brandt
179
Voted
EUROPAR
2001
Springer
15 years 11 months ago
A Software Architecture for User Transparent Parallel Image Processing on MIMD Computers
Abstract. This paper describes a software architecture that allows image processing researchers to develop parallel applications in a transparent manner. The architecture’s main ...
Frank J. Seinstra, Dennis Koelma, Jan-Mark Geusebr...
SAC
2009
ACM
16 years 1 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe