Results 271 to 280 of about 2,544,042 (295)
Some of the next articles are maybe not open access.
Global parametric search and left ventricular identification
Annals of Biomedical Engineering, 1981A mathematical model of left ventricular (LV) function in the dog has been developed. Based on a time-varying systolic elastance, the fitting procedure combined a local search according to a second-order method with a global heuristic search and provided beat-to-beat uncertainty intervals for each of the model parameters.
Guy Demoment, Jacques Hinglais
openaire +1 more source
Automated parametrization of custom search ranking functions
2010 International Conference on Electronics and Information Engineering, 2010The search for information is a task most commonly performed by web search engines. A common problem in web search is the personalization of search results. Personalization is essentially a customization of the results ranking formula. This paper focuses on the automation of the ranking formula according to the user's preferences.
Sandi Pohorec +3 more
openaire +1 more source
Fractals, 2018
An innovative reconfiguration application is proposed to re-calculate the parameters of the Ferragina and Manzini exact search algorithm (or FM indexes), using a modular and efficient hardware implementation to accelerate alignment programs of short DNA ...
D. P. Bautista +6 more
semanticscholar +1 more source
An innovative reconfiguration application is proposed to re-calculate the parameters of the Ferragina and Manzini exact search algorithm (or FM indexes), using a modular and efficient hardware implementation to accelerate alignment programs of short DNA ...
D. P. Bautista +6 more
semanticscholar +1 more source
Interdistance Selection by Parametric Search
1987The selection problem asks for the k"' largest or smallest element in a set S. In general, selection takes linear time, but if the set is constrained so that sotne relations between elements are known, sublinear time selection is sometimes possible.
openaire +1 more source
Parametric sonars in searching of buried objects
The Journal of the Acoustical Society of America, 2008The subject of this paper is the description of usage of the parametric sonar for searching of the objects that are on the surface of the seabed or very close to it. Searching of underwater objects, especially these ones buried in the seabed has a very practical meaning.
openaire +1 more source
L-infinity interdistance selection by parametric search
Information Processing Letters, 1989The selection problem asks for the kth largest or smallest element in a set S. In general, selection takes linear time, but if the set is constrained so that some relations between elements are known, sublinear- time selection is sometimes possible. We present an algorithm that selects the kth largest or smallest element from a Cartesian sum in O(n log
openaire +1 more source
Fractional Packing and Parametric Search Frameworks
2016The following chapter introduces three generic frameworks that will be used throughout this thesis. On the one hand, the focus will be set on the parametric search framework due to Megiddo (1979, 1983), which can often be used to solve parametric variants of known combinatorial problems in strongly polynomial time. On the other hand, we will review the
openaire +1 more source
Parametric tabu-search for mixed integer programs
Computers & Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Decision Trees with Parametric Enlarged Local Search
2002Lately, decision trees became an important tool in marketing research, e.g. to classify potential customers in order to send individual ads to them. In contrast to many other situations here the classification should be done in such a manner that not the inhomogeneity of subsets is minimised but a cost orientated loss function.
Andreas Hilbert, Henning Paul
openaire +1 more source