1332 search results - page 149 / 267 » Combinatorial Algorithms |
TIT
2008
13 years 9 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
UIST
2006
ACM
14 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper proposes a joint server/peer video streaming architecture for wireless networks, where a receiver can access a video server via an access point using the infrastructure...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
WINE
2005
Springer
14 years 2 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...