Lattice-Search Runtime Distributions May Be Heavy-Tailed

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A00085203" target="_blank" >RIV/68407700:21230/03:00085203 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Lattice-Search Runtime Distributions May Be Heavy-Tailed

Original language description

The paper shows that the runtime distribution of lattice searches conducted by an ILP algorithm when solving two example important learning problems are heavy-tailed, ie.they decay slower than exponentially. This observation is exploited by an adaptationof the method of rapid randomized restarts towards a significant reduction of the average runtime

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

R - Projekt Ramcoveho programu EK

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Inductive Logic Programming

ISBN

3-540-00567-6

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

—

Publisher name

Springer VDI Verlag

Place of publication

Düsseldorf

Event location

Sydney

Event date

Jul 9, 2002

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—