18306 search results - page 346 / 3662 » Algorithmics in Exponential Time |
208
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
190
click to vote
ISAAC
2005
Springer
16 years 9 days ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
229
click to vote
MLDM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
179
click to vote
HIPC
2003
Springer
16 years 20 hour ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
210
click to vote
CGF
2011
15 years 1 months ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard