Sciweavers

65 search results - page 3 / 13
» Heuristic Search Applied to Abstract Combat Games
Sort
View
WABI
2004
Springer
14 years 1 months ago
Local Search Heuristic for Rigid Protein Docking
Abstract. We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and...
Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunne...
SBP
2011
Springer
12 years 10 months ago
Consumer Search, Rationing Rules, and the Consequence for Competition
Abstract. Firms’ conjectures about demand are consequential in oligopoly games. Through agent-based modeling of consumers’ search for products, we can study the rationing of de...
Christopher S. Ruebeck
TCBB
2008
107views more  TCBB 2008»
13 years 7 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
EOR
2007
364views more  EOR 2007»
13 years 7 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 1 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...