Sciweavers

4940 search results - page 553 / 988
» On the Complexity of Universal Programs
Sort
View
174
Voted
ENTCS
2008
121views more  ENTCS 2008»
15 years 6 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
BMCBI
2006
109views more  BMCBI 2006»
15 years 6 months ago
GPNN: Power studies and applications of a neural network method for detecting gene-gene interactions in studies of human disease
Background: The identification and characterization of genes that influence the risk of common, complex multifactorial disease primarily through interactions with other genes and ...
Alison A. Motsinger, Stephen L. Lee, George Mellic...
195
Voted
CAL
2006
15 years 6 months ago
A Page-based Hybrid (Software-Hardware) Dynamic Memory Allocator
Modern programming languages often include complex mechanisms for dynamic memory allocation and garbage collection. These features drive the need for more efficient implementation ...
Wentong Li, Saraju P. Mohanty, Krishna M. Kavi
COR
2007
95views more  COR 2007»
15 years 6 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
JUCS
2008
118views more  JUCS 2008»
15 years 6 months ago
Controlling Aspect Reentrancy
: Aspect languages provide different mechanisms to control when an aspect should apply based on properties of the execution context. They however fail to explicitly identify and cl...
Éric Tanter