Sciweavers

1413 search results - page 18 / 283
» ideas 2007
Sort
View
IPCO
2001
166views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
63
Voted
SERP
2004
14 years 10 months ago
Keeping Secrets within a Family: Rediscovering Parnas
David Parnas wrote several papers in the 1970's and 1980's that are now considered classics. The concepts he advocated such as information hiding and bstract interfaces ...
H. Conrad Cunningham, Cuihua Zhang, Yi Liu
NAACL
2003
14 years 10 months ago
Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network
We present a new part-of-speech tagger that demonstrates the following ideas: (i) explicit use of both preceding and following tag contexts via a dependency network representation...
Kristina Toutanova, Dan Klein, Christopher D. Mann...
ACL
1994
14 years 10 months ago
An Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular alg...
Mark-Jan Nederhof
IJCAI
1993
14 years 10 months ago
Evolutionary Learning Strategy using Bug-Based Search
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
Hitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisu...