Sciweavers

595 search results - page 48 / 119
» The Graph Programming Language GP
Sort
View
CP
2005
Springer
14 years 1 months ago
Domain Reduction for the Circuit Constraint
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
Latife Genç Kaya, John N. Hooker
ENTCS
2006
135views more  ENTCS 2006»
13 years 7 months ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
ICFP
2008
ACM
14 years 7 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
ICDT
1997
ACM
90views Database» more  ICDT 1997»
13 years 12 months ago
Adding Structure to Unstructured Data
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
Peter Buneman, Susan B. Davidson, Mary F. Fernande...
IJPP
2011
99views more  IJPP 2011»
13 years 2 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne