1933 search results - page 133 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
126
click to vote
ACL
1992
15 years 5 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....
131
Voted
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
140
click to vote
EMO
2003
Springer
15 years 9 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
138
Voted
IJIG
2008
15 years 4 months ago
2008
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
158
Voted
CSC
2009
15 years 5 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...