Sciweavers

837 search results - page 26 / 168
» Hard combinators
Sort
View
94
Voted
ICFP
2009
ACM
15 years 5 months ago
Finding race conditions in Erlang with QuickCheck and PULSE
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
Koen Claessen, Michal Palka, Nicholas Smallbone, J...
76
Voted
IPPS
2009
IEEE
15 years 4 months ago
Building a parallel pipelined external memory algorithm library
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...
Andreas Beckmann, Roman Dementiev, Johannes Single...
IEEEPACT
2007
IEEE
15 years 4 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
81
Voted
NLDB
2007
Springer
15 years 4 months ago
Automatic Issue Extraction from a Focused Dialogue
Various methodologies for structuring the process of domain modeling have been proposed, but there are few software tools that provide automatic support for the process of construc...
Koen V. Hindriks, Stijn Hoppenbrouwers, Catholijn ...
79
Voted
ICDM
2003
IEEE
102views Data Mining» more  ICDM 2003»
15 years 3 months ago
Bootstrapping Rule Induction
Most rule learning systems posit hard decision boundaries for continuous attributes and point estimates of rule accuracy, with no measures of variance, which may seem arbitrary to ...
Lemuel R. Waitman, Douglas H. Fisher, Paul H. King