284 search results - page 40 / 57 » On the adaptable chromatic number of graphs |
126
Voted
ICSE
2009
IEEE-ACM
14 years 10 months ago
2009
IEEE-ACM
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
106
Voted
ESANN
2007
15 years 2 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
EOR
2010
15 years 19 days ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
85
Voted
ARITH
2005
IEEE
15 years 6 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
102
Voted
ICPADS
2006
IEEE
15 years 6 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...