439 search results - page 64 / 88 » Neighborhood Structures for GPU-Based Local Search Algorithm... |
118
click to vote
TPDS
2002
14 years 11 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
108
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
115
click to vote
HUMO
2007
Springer
15 years 3 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
102
click to vote
AAAI
1997
15 years 1 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
BMCBI
2007
14 years 12 months ago
2007
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...