1569 search results - page 131 / 314 » Programming contest strategy |
86
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
110
Voted
PC
1998
15 years 7 days ago
1998
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
83
Voted
WIA
2005
Springer
15 years 6 months ago
2005
Springer
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we deri...
98
Voted
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
79
Voted
ECLIPSE
2007
ACM
15 years 4 months ago
2007
ACM
The navigation of structural dependencies (e.g., method invocations) when a developer performs a change task is an effective strategy in program investigation. Several existing ap...