Sciweavers

377 search results - page 3 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
NAACL
2010
13 years 6 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
GECCO
2006
Springer
184views Optimization» more  GECCO 2006»
14 years 16 days ago
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
Thomas Butter, Franz Rothlauf, Jörn Grahl, To...
SIGMOD
2011
ACM
331views Database» more  SIGMOD 2011»
12 years 11 months ago
Query optimization techniques for partitioned tables
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
Herodotos Herodotou, Nedyalko Borisov, Shivnath Ba...
ACL
2011
13 years 15 days ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
PC
2011
314views Management» more  PC 2011»
13 years 3 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...