Sciweavers

2314 search results - page 82 / 463
» Monoids over domains
Sort
View
PVM
2007
Springer
15 years 6 months ago
Grid Services for MPI
Institutional grids consist of the aggregation of clusters belonging to different administrative domains to build a single parallel machine. To run an MPI application over an inst...
Camille Coti, Ala Rezmerita, Thomas Hérault...
CIE
2005
Springer
15 years 5 months ago
How to Compare the Power of Computational Models
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
Udi Boker, Nachum Dershowitz
FPL
2004
Springer
101views Hardware» more  FPL 2004»
15 years 5 months ago
Automatic Creation of Reconfigurable PALs/PLAs for SoC
Many System-on-a-Chip devices would benefit from the inclusion of reprogrammable logic on the silicon die, as it can add general computing ability, provide run -time reconfigurabil...
Mark Holland, Scott Hauck
PPDP
2004
Springer
15 years 5 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
AAAI
2007
15 years 2 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli