Sciweavers

4757 search results - page 160 / 952
» Monads for Functional Programming
Sort
View
EACL
2003
ACL Anthology
15 years 7 months ago
Linear Text Segmentation using a Dynamic Programming Algorithm
In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within...
Athanasios Kehagias, Pavlina Fragkou, Vassilios Pe...
GPEM
2010
180views more  GPEM 2010»
15 years 5 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf
ESOP
2012
Springer
14 years 2 months ago
Generate, Test, and Aggregate - A Calculation-based Framework for Systematic Parallel Programming with MapReduce
Abstract. MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel progra...
Kento Emoto, Sebastian Fischer, Zhenjiang Hu
FSEN
2007
Springer
16 years 17 days ago
A Model of Component-Based Programming
Abstract. Component-based programming is about how to create application programs from prefabricated components with new software that provides both glue between the components, an...
Xin Chen, Jifeng He, Zhiming Liu, Naijun Zhan
SIGSOFT
2002
ACM
16 years 7 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...