3875 search results - page 664 / 775 » Approximation Algorithms for the Max-coloring Problem |
WADS
2005
Springer
14 years 2 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
NOMS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
ASPDAC
2001
ACM
14 years 20 days ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
KDD
2000
ACM
14 years 18 days ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...