Sciweavers

88 search results - page 10 / 18
» Regular Cost Functions over Finite Trees
Sort
View
POPL
2010
ACM
14 years 7 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 9 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...
ICDCS
2006
IEEE
14 years 3 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
CSCLP
2008
Springer
13 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
JSAC
2006
112views more  JSAC 2006»
13 years 9 months ago
Optimal Bandwidth Allocation in a Delay Channel
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
Navid Ehsan, Mingyan Liu