71228 search results - page 175 / 14246 » Algorithms |
128
click to vote
ICMLA
2008
15 years 3 months ago
2008
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
WALCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
100
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
UAI
1993
15 years 3 months ago
1993
We examine two types of similarity networks each based on a distinct notion of relevance. For both types of similarity networks we present an efficient inference algorithm that wo...
103
click to vote
ACL
1992
15 years 2 months ago
1992
An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents....