Sciweavers

3281 search results - page 438 / 657
» Bases for parametrized iterativity
Sort
View
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
EOR
2008
119views more  EOR 2008»
15 years 6 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn
EOR
2006
66views more  EOR 2006»
15 years 6 months ago
Multi-period capacity expansion for a local access telecommunications network
In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the ...
Michel Gendreau, Jean-Yves Potvin, Ali Smires, Pat...
COMPUTING
2007
103views more  COMPUTING 2007»
15 years 6 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
INTEGRATION
2006
102views more  INTEGRATION 2006»
15 years 6 months ago
A parameterized graph-based framework for high-level test synthesis
Improving testability during the early stages of high-level synthesis has several benefits including reduced test hardware overheads, reduced test costs, reduced design iterations...
Saeed Safari, Amir-Hossein Jahangir, Hadi Esmaeilz...