Sciweavers

161 search results - page 18 / 33
» Lazy call-by-value evaluation
Sort
View
APLAS
2009
ACM
14 years 2 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 1 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
CW
2006
IEEE
14 years 1 months ago
Error Minimising Pipeline for Hi-Fidelity, Scalable Geospatial Simulation
The geospatial category of simulations is used to show how origin centric techniques can solve a number of accuracy related problems common to 3D computer graphics applications. P...
Chris Thorne
PADL
2004
Springer
14 years 29 days ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
CORR
2000
Springer
132views Education» more  CORR 2000»
13 years 7 months ago
A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation
This paper describes a set of comparative experiments, including cross{corpus evaluation, between ve alternative algorithms for supervised Word Sense Disambiguation (WSD), namely ...
Gerard Escudero, Lluís Màrquez, Germ...