Sciweavers

558 search results - page 82 / 112
» Trees and Matchings
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 3 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
112
Voted
AAAI
1994
15 years 3 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
102
Voted
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
15 years 2 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
VLSISP
2008
132views more  VLSISP 2008»
15 years 1 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
15 years 1 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...