1723 search results - page 228 / 345 » Cycling in linear programming problems |
CASES
2010
ACM
14 years 7 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
105
click to vote
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...