Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials.

Peter Poensgen; Ralf Möller

Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials.

Original language	English
Article number	1
Journal	Open J. Databases
Volume	7
Issue number	1
Pages (from-to)	12-20
Number of pages	9
Publication status	Published - 2020

Research Areas and Centers

Centers: Center for Artificial Intelligence Luebeck (ZKIL)
Research Area: Intelligent Systems

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

Cite this

@article{b2dcb8f4883c4abaaf50648e39521e6f,

title = "Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials.",

author = "Peter Poensgen and Ralf M{\"o}ller",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2020",

language = "English",

volume = "7",

pages = "12--20",

journal = "Open J. Databases",

number = "1",

}

TY - JOUR

T1 - Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials.

AU - Poensgen, Peter

AU - Möller, Ralf

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2020

Y1 - 2020

M3 - Journal articles

VL - 7

SP - 12

EP - 20

JO - Open J. Databases

JF - Open J. Databases

IS - 1

M1 - 1

ER -