7129 search results - page 97 / 1426 » Approximation Algorithms for Treewidth |
148
click to vote
CSC
2009
15 years 4 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
123
Voted
DISOPT
2008
15 years 3 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
JGAA
2006
15 years 3 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
165
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
105
click to vote
P2P
2009
IEEE
15 years 9 months ago
2009
IEEE
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...