Výsledky vyhledávání

A structural approach to kernels for ILPs

Autor: Jansen, B.M.P., Kratsch, S., Bansal, N., Finocchi, I.

Publikováno v: Algorithms-ESA 2015 ISBN: 9783662483497
ESA
Algorithms-ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 779-791
STARTPAGE=779;ENDPAGE=791;TITLE=Algorithms-ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings

Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-the-art ILP-solvers like CPLEX. Motivated by this, previous work studie

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae3b4ea7d6ce94c60a96681135259922
https://doi.org/10.1007/978-3-662-48350-3_65

Zobrazit plný text záznamu

Approximating minimum-area rectangular and convex containers for packing convex polygons

Autor: Alt, H.W., de Berg, M.T., Knauer, C., Bansel, N., Finocchi, I.

Publikováno v: Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 25-34
STARTPAGE=25;ENDPAGE=34;TITLE=Algorithms-ESA 2015
Algorithms-ESA 2015 ISBN: 9783662483497

We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab0b943a5ffd9bebf6e462990606694f
https://doi.org/10.1007/978-3-662-48350-3_3

Zobrazit plný text záznamu

Akademický článek

EDSCVD: Enhanced Dual-Channel Smart Contract Vulnerability Detection Method.

Autor: Wu, Huaiguang^1,2 (AUTHOR) hgawu@126.com, Peng, Yibo^1,2 (AUTHOR) shenyi0089@163.com, He, Yaqiong^1,2 (AUTHOR) shenyi0089@163.com, Lu, Siqi³ (AUTHOR) 080lusiqi@sina.com

Publikováno v: Symmetry (20738994). Oct2024, Vol. 16 Issue 10, p1381. 21p.

Zobrazit plný text záznamu

Plný text ve formátu HTML

Computing the Similarity Between Moving Curves

Autor: Buchin, K., Ophelders, T.A.E., Speckmann, B., Bansal, N., Finocchi, I.

Publikováno v: Algorithms-ESA 2015 ISBN: 9783662483497
ESA
Proc. 23rd Annual European Symposium on Algorithms (ESA), 928-940
STARTPAGE=928;ENDPAGE=940;TITLE=Proc. 23rd Annual European Symposium on Algorithms (ESA)

In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time. We therefore focus o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c707419f3addeeaf3696370d798e3048
https://doi.org/10.1007/978-3-662-48350-3_77

Zobrazit plný text záznamu

ScienzaLudica.it - Impariamo con il LEGO

Autor: Quercioli F., Giacomelli G., Puccioni G.P., Tiribilli B., Vassalli M., Basso M., Barani E., Danti P., Finocchi I., Monni N., Mati F., Borchi A., Niccolai R.

Publikováno v: Giornale di fisica della Società italiana di fisica (Testo stamp.) 50(3) (2009): 197–210. doi:10.1393/gdf/i2009-10109-6
info:cnr-pdr/source/autori:Quercioli F., Giacomelli G., Puccioni G.P., Tiribilli B., Vassalli M., Basso M., Barani E., Danti P., Finocchi I., Monni N., Mati F., Borchi A., Niccolai R./titolo:ScienzaLudica.it-Impariamo con il LEGO/doi:10.1393%2Fgdf%2Fi2009-10109-6/rivista:Giornale di fisica della Società italiana di fisica (Testo stamp.)/anno:2009/pagina_da:197/pagina_a:210/intervallo_pagine:197–210/volume:50(3)

Riassunto. Sono più di dieci anni ormai che, con alterne vicende, giochiamo con il LEGO escogitando nuovi esperimenti per invogliare studenti dogni ordine e grado e semplici curiosi ad avvicinarsi alla scienza in modo divertente. Con il contri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=cnr_________::9063ede39745b338119b6694cfde0ece
http://www.cnr.it/prodotto/i/74248

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání