2899 search results - page 289 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
178
click to vote
AISC
1998
Springer
15 years 11 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
164
click to vote
LPNMR
1997
Springer
15 years 10 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
187
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
157
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
173
click to vote
ICMCS
2006
IEEE
16 years 21 days ago
2006
IEEE
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...