1983 search results - page 144 / 397 » Competitive graph searches |
ACL
2004
13 years 9 months ago
2004
This paper describes an incremental parsing approach where parameters are estimated using a variant of the perceptron algorithm. A beam-search algorithm is used during both traini...
ACL
2004
13 years 9 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
ICGA
1997
13 years 9 months ago
1997
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
SCHEDULING
2010
13 years 2 months ago
2010
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunicatio...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...