697 search results - page 44 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In the past several years, we’ve been studying feature transformation (FT) approaches to robust automatic speech recognition (ASR) which can compensate for possible “distortio...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
UC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...