1569 search results - page 131 / 314 » Programming contest strategy |
143
click to vote
IPPS
2008
IEEE
16 years 23 days 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...
179
click to vote
PC
1998
15 years 6 months 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...
149
click to vote
WIA
2005
Springer
15 years 11 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...
158
click to vote
MFCS
1997
Springer
15 years 10 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...
126
click to vote
ECLIPSE
2007
ACM
15 years 10 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...