1053 search results - page 17 / 211 » On k-Path Covers and their applications |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
BMCBI
2010
13 years 9 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
ENGL
2008
13 years 7 months ago
2008
Mobile application development belongs on the complicated, but quite regular software development environment that includes many different solutions possibilities in the developmen...