248 search results - page 23 / 50 » The Relative Complexity of NP Search Problems |
146
click to vote
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
246
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
143
click to vote
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
126
click to vote
IJCAI
2003
15 years 5 months ago
2003
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
156
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...