Sciweavers

3775 search results - page 224 / 755
» The Expression Problem Revisited
Sort
View
ICDCSW
2009
IEEE
15 years 2 months ago
Automated Service Composition in Next-Generation Networks
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...
Shashank Shanbhag, Xin Huang, Santosh Proddatoori,...
IJCAI
2003
15 years 6 months ago
Temporal Reasoning with Preferences and Uncertainty
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
GPCE
2004
Springer
15 years 10 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
BMCBI
2006
88views more  BMCBI 2006»
15 years 5 months ago
A two-sample Bayesian t-test for microarray data
Background: Determining whether a gene is differentially expressed in two different samples remains an important statistical problem. Prior work in this area has featured the use ...
Richard J. Fox, Matthew W. Dimmic
LMCS
2007
132views more  LMCS 2007»
15 years 4 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla