Sciweavers

6976 search results - page 106 / 1396
» The Oil Searching Problem
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
151
Voted
ESWS
2008
Springer
15 years 8 months ago
Microsearch: An Interface for Semantic Search
In this paper we discuss the potential for semantic search and focus on the most immediate problem toward its realization: the problem of the sparsity and relatively low quality of...
Peter Mika
HM
2007
Springer
118views Optimization» more  HM 2007»
16 years 9 days ago
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 10 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
MST
2010
81views more  MST 2010»
15 years 4 months ago
Quantum Search with Variable Times
Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items x1, . . . , xn and we would like
Andris Ambainis