1940 search results - page 81 / 388 » Search with Synonyms: Problems and Solutions |
168
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
163
click to vote
PAMI
2011
15 years 1 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
170
click to vote
AMT
2009
Springer
16 years 28 days ago
2009
Springer
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
176
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
185
click to vote
PRICAI
1998
Springer
15 years 10 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...