Sciweavers

759 search results - page 125 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 1 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
AI
1999
Springer
14 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
72
Voted
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 3 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
IJRR
2010
115views more  IJRR 2010»
14 years 7 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
107
Voted
ECCV
2008
Springer
15 years 11 months ago
Learning Visual Shape Lexicon for Document Image Content Recognition
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...
Guangyu Zhu, Xiaodong Yu, Yi Li, David S. Doermann