Sciweavers

1989 search results - page 51 / 398
» Set functions for functional logic programming
Sort
View
FLOPS
2008
Springer
13 years 12 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
WCFLP
2005
ACM
14 years 3 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
HICSS
2006
IEEE
135views Biometrics» more  HICSS 2006»
14 years 4 months ago
Using Function Generalization to Design a Cosequential Processing Framework
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
H. Conrad Cunningham, Pallavi Tadepalli
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 10 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
FOIKS
2010
Springer
14 years 1 months ago
On the Existence of Armstrong Data Trees for XML Functional Dependencies
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
Sven Hartmann, Henning Köhler, Thu Trinh