Sciweavers

759 search results - page 40 / 152
» What Can Be Implemented Anonymously
Sort
View
APLAS
2007
ACM
14 years 1 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
FSTTCS
2000
Springer
14 years 1 months ago
Combining Semantics with Non-standard Interpreter Hierarchies
This paper reports on results concerning the combination of non-standard semantics via interpreters. We define what a semantics combination means and identify under which condition...
Sergei M. Abramov, Robert Glück
IQ
1997
13 years 11 months ago
Total Data Quality Management: The Case of IRI
Implementing a Total Data Quality Management (TDQM) program is not a trivial undertaking. Two key steps are (1) to clearly define what an organization means by data quality and (2...
Rita Kovac, Yang W. Lee, Leo Pipino
TOPNOC
2008
13 years 9 months ago
Constructive Alignment for Teaching Model-Based Design for Concurrency
"How can we make sure our students learn what we want them to?" is the number one question in teaching. This paper is intended to provide the reader with: i) a general a...
Claus Brabrand
MOR
2010
106views more  MOR 2010»
13 years 8 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...