1964 search results - page 161 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
IPPS
1998
IEEE
14 years 9 days ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
EWSN
2009
Springer
14 years 8 months ago
2009
Springer
As many radio chips used in today's sensor mote hardware can work at different frequencies, several multi-channel communication protocols have recently been proposed to improv...
BMCBI
2010
13 years 8 months ago
2010
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
CDC
2009
IEEE
14 years 24 days ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
AAAI
2010
13 years 9 months ago
2010
The selection of the action to do next is one of the central problems faced by autonomous agents. In AI, three approaches have been used to address this problem: the programming-b...