29908 search results - page 353 / 5982 » On the Complexity of |
154
click to vote
ICRA
2005
IEEE
16 years 12 days ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
157
click to vote
COCOON
2005
Springer
16 years 10 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
173
click to vote
COCOON
2005
Springer
16 years 10 days ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
184
Voted
GRID
2005
Springer
16 years 10 days ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
162
click to vote
ICTCS
2005
Springer
16 years 9 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...