Sciweavers

1071 search results - page 23 / 215
» Programming with enumerable sets of structures
Sort
View
ICFP
2012
ACM
12 years 1 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 11 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
WCRE
2000
IEEE
14 years 3 months ago
A Structured Demonstration of Program Comprehension Tools
This paper describes a structured tool demonstration, a hybrid evaluation technique that combines elements from experiments, case studies, and technology demonstrations. Developer...
Susan Elliott Sim, Margaret-Anne D. Storey
ILP
1998
Springer
14 years 3 months ago
Application of Inductive Logic Programming to Discover Rules Governing the Three-Dimensional Topology of Protein Structure
Abstract. Inductive Logic Programming (ILP) has been applied to discover rules governing the three-dimensional topology of protein structure. The data-set unifies two sources of in...
Marcel Turcotte, Stephen Muggleton, Michael J. E. ...
CLUSTER
2006
IEEE
14 years 5 months ago
TGrid - Grid runtime support for hierarchically structured task-parallel programs
In this article we introduce a grid runtime system called TGrid which is designed to run hierarchically structured task-parallel programs on heterogenous environments and can also...
Sascha Hunold, Thomas Rauber, Gudula Rünger