2233 search results - page 195 / 447 » On the Complexity of Theory Curbing |
175
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
183
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in...
145
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
170
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
182
click to vote
IJBC
2008
15 years 6 months ago
2008
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...