3192 search results - page 83 / 639 » The minimum latency problem |
139
click to vote
ICALP
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
137
click to vote
IWANN
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper we address the problem of blind source extraction of a subset of “interesting” independent sources from a linear convolutive or instantaneous mixture. T...
157
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
143
click to vote
JUCS
2010
15 years 4 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
179
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...