Sciweavers

3192 search results - page 83 / 639
» The minimum latency problem
Sort
View
ICALP
2007
Springer
15 years 4 months ago
Minimum-Time Reachability in Timed Games
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 ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
IWANN
2001
Springer
15 years 2 months ago
The Minimum Entropy and Cumulants Based Contrast Functions for Blind Source Extraction
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...
Sergio Cruces, Andrzej Cichocki, Shun-ichi Amari
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 1 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
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...
Thang Nguyen Bui, Catherine M. Zrncic
JUCS
2010
117views more  JUCS 2010»
14 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
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...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
DCC
2005
IEEE
15 years 9 months ago
Towards Practical Minimum-Entropy Universal Decoding
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...
Todd P. Coleman, Muriel Médard, Michelle Ef...