Sciweavers

589 search results - page 87 / 118
» Matching Concavity Trees
Sort
View
AAAI
1994
13 years 9 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 8 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
DISOPT
2010
132views more  DISOPT 2010»
13 years 8 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
VLSISP
2008
132views more  VLSISP 2008»
13 years 8 months ago
Serial and Parallel FPGA-based Variable Block Size Motion Estimation Processors
H.264/AVC is the latest video coding standard adopting variable block size motion estimation (VBS-ME), quarter-pixel accuracy, motion vector prediction and multi-reference frames f...
Brian M. H. Li, Philip Heng Wai Leong
CL
2000
Springer
13 years 8 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...