88 search results - page 10 / 18 » Regular Cost Functions over Finite Trees |
132
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
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...
112
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
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...
115
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
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,...
114
Voted
JSAC
2006
14 years 11 months ago
2006
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...