Sciweavers

945 search results - page 40 / 189
» Incremental Branching Programs
Sort
View
ISPD
2000
ACM
108views Hardware» more  ISPD 2000»
14 years 2 days ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
Yu-Yen Mo, Chris C. N. Chu
IPPS
2006
IEEE
14 years 1 months ago
Incrementally developing parallel applications with AspectJ
1 This paper presents a methodology to develop more modular parallel applications, based on aspect oriented programming. Traditional object oriented mechanisms implement applicatio...
João Luís Sobral
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ICFP
2002
ACM
14 years 7 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
WWW
2005
ACM
14 years 1 months ago
Incremental maintenance for materialized XPath/XSLT views
This paper proposes an incremental maintenance algorithm that efficiently updates the materialized XPath/XSLT views defined using XPath expressions in XP{[],∗,//,vars} . The al...
Makoto Onizuka, Fong Yee Chan, Ryusuke Michigami, ...