Sciweavers

4757 search results - page 146 / 952
» Monads for Functional Programming
Sort
View
SCAM
2006
IEEE
16 years 11 days ago
Comparative Study of Refactoring Haskell and Erlang Programs
Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier to understand, modify, or reuse. Taking Haskell an...
Huiqing Li, Simon Thompson
RECOMB
2005
Springer
16 years 6 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 27 days ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CPAIOR
2007
Springer
16 years 16 days ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
15 years 10 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook