439 search results - page 22 / 88 » Neighborhood Structures for GPU-Based Local Search Algorithm... |
AAAI
2000
13 years 10 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
UAI
2008
13 years 10 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
To keep an overview of a complex corporate web sites, it is crucial to understand the relationship of contents, structure and the user's behavior. In this paper, we describe ...
JCO
2007
13 years 8 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...