1185 search results - page 171 / 237 » The Equivalence of Sampling and Searching |
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
IJCAI
2007
13 years 9 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
PUK
2001
13 years 9 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
TREC
2003
13 years 9 months ago
2003
We describe our participation in both tasks in the 2003 TREC Genomics track. For the primary task we concentrated mainly upon query expansion and species-specific document search...
ISKO
1997
13 years 9 months ago
1997
This paper was prepared for a lecture at a recent meeting of the German Chapter of ISKO devoted to Wissensorganisation mit Multimedialen Techniken [Knowledge Organization with Mul...