7150 search results - page 103 / 1430 » An Approximation Algorithm for Approximation Rank |
115
click to vote
DFG
2009
Springer
15 years 9 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
117
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
129
click to vote
AAAI
2010
15 years 3 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
140
Voted
CSC
2009
15 years 3 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...