Sciweavers

2736 search results - page 236 / 548
» Implementable allocation rules
Sort
View
AAAI
2010
15 years 8 months ago
A Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
Gilles Audemard, George Katsirelos, Laurent Simon
ENTCS
2006
114views more  ENTCS 2006»
15 years 6 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
ICFP
2005
ACM
16 years 6 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
16 years 27 days ago
Ontology Driven CPG Authoring and Execution via a Semantic Web Framework
Clinical Practice Guidelines (CPG) are used by healthcare practitioners to standardize clinical practice and to provide evidence mediated health-care. Currently, there have been c...
Sajjad Hussain, Syed Sibte Raza Abidi
DOCENG
2004
ACM
16 years 6 hour ago
A three-way merge for XML documents
Three-way merging is a technique that may be employed for reintegrating changes to a document in cases where multiple independently modified copies have been made. While tools fo...
Tancred Lindholm