666 search results - page 110 / 134 » The Pipelined Set Cover Problem |
103
Voted
FOCS
1993
IEEE
15 years 6 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
110
click to vote
SIGMOD
1995
ACM
15 years 5 months ago
1995
ACM
In a digital library system, documents are available in digital form and therefore are more easily copied and their copyrights are more easily violated. This is a very serious pro...
90
Voted
AAAI
2008
15 years 4 months ago
2008
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
123
Voted
CCIA
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Text detection in urban scenes is a hard task due to the high variability of text appearance: different text fonts, changes in the point of view, or partial occlusion are...
109
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...