1512 search results - page 7 / 303 » When Suboptimal Rules |
ACL
1994
13 years 11 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
ISPD
1999
ACM
14 years 2 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
GBRPR
2005
Springer
14 years 3 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
MSS
2010
IEEE
13 years 8 months ago
2010
IEEE
Axioms of monotonicity, efficiency and continuity are shown to characterize the relative majority rule when there are only two alternatives. The absolute majority rule and the rel...