246 search results - page 12 / 50 » Dynamic Local Search for the Maximum Clique Problem |
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
IJCAI
2007
14 years 11 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
TROB
2011
14 years 4 months ago
2011
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
AAAI
2004
14 years 11 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...