1689 search results - page 92 / 338 » Proximate point searching |
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
90
Voted
DGO
2003
15 years 2 months ago
2003
In environments containing many text search engines a federated search system provides people with a single point of access. When search engines are managed by independent organiz...
92
Voted
AAAI
1997
15 years 2 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
93
Voted
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
136
click to vote
COMAD
2009
14 years 10 months ago
2009
The continuous and rapid advent in mobile and communications technology opens the way for new research areas and new applications. Moving Object Databases(MODs) are among the emer...