Global Endemism Needs Spatial Integration [with Response]

Autor: LEI, FU-MIN, SANDEL, B., ARGE, L., DALSGAARD, B., DAVIES, R. G., GASTON, K. J., SUTHERLAND, W. J., SVENNING, J.-C.

Publikováno v: Science, 2012 Jan . 335(6066), 284-286.

Externí odkaz: http://dx.doi.org/10.1126/science.335.6066.284-b

Population genetic analysis of brazilian peach breeding germplasm

Autor: THUROW, L. B., RASEIRA, M. do C. B., BONOW, S., ARGE, L. W. P., CASTRO, C. M.

Publikováno v: Repositório Institucional da EMBRAPA (Repository Open Access to Scientific Information from EMBRAPA-Alice)
Empresa Brasileira de Pesquisa Agropecuária (Embrapa)
instacron:EMBRAPA

Made available in DSpace on 2018-01-09T16:14:41Z (GMT). No. of bitstreams: 1 CarolineCastroThurowRBF2017.pdf: 478573 bytes, checksum: 1bfd0f9764f773a48d5d7250ac26a172 (MD5) Previous issue date: 2018-01-09

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3056::827491150095dd2fac8cb94a1bc30a24
http://www.alice.cnptia.embrapa.br/alice/handle/doc/1084635

The ComBack method: extending hash compaction with backtracking

Autor: Westergaard, M., Kristensen, L.M., Brodal, G.S., Arge, L., Yakovlev, A., Kleijn, J.

Publikováno v: Petri Nets and Other Models of Concurrency – ICATPN 2007 ISBN: 9783540730934
ICATPN
Proceedings of the 28th International Conference on Petri Nets and Other Models of Concurrency (ICATPN 2007), 25-29 June 2007, Siedcle, Poland, 445-464
STARTPAGE=445;ENDPAGE=464;TITLE=Proceedings of the 28th International Conference on Petri Nets and Other Models of Concurrency (ICATPN 2007), 25-29 June 2007, Siedcle, Poland

This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state space is guaranteed. Each encountered state is mapped into a compressed

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a16b242b3feddfee4041957c60fb4042
https://doi.org/10.1007/978-3-540-73094-1_26

Competitive algorithms for due date scheduling

Autor: Bansal, N., Chan, H.L., Pruhs, K.R., Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A.

Publikováno v: Automata, Languages and Programming ISBN: 9783540734192
ICALP
Automata, Languages and Programming (34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007. Proceedings), 28-39
STARTPAGE=28;ENDPAGE=39;TITLE=Automata, Languages and Programming (34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007. Proceedings)

We consider several online scheduling problems that arise when customers request make-to-order products from a company. At the time of the order, the company must quote a due date to the customer. To satisfy the customer, the company must produce the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1b5d95f3af0ec7de2fbd6662473d977
https://doi.org/10.1007/978-3-540-73420-8_5

An optimal and practical cache-oblivious algorithm for computing multiresolution rasters

Autor: Arge, L., Brodal, G.S., Truelsen, J., Tsirogiannis, C.

Publikováno v: Arge, L, Brodal, G S, Truelsen, J & Tsirogiannis, C 2013, An optimal and practical cache-oblivious algorithm for computing multiresolution rasters . in Algorithms – ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings . Springer VS, Lecture Notes in Computer Science, vol. 8125, pp. 61-72, Sophia Antipolis, France, 02/09/2013 . https://doi.org/10.1007/978-3-642-40450-4_6
Arge, L, Brodal, G S, Truelsen, J & Tsirogiannis, C 2013, An optimal and practical cache-oblivious algorithm for computing multiresolution rasters . in Algorithms – ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings . Springer VS, Lecture Notes in Computer Science, vol. 8125, pp. 61-72, European Symposium on Algorithms, Sophia Antipolis, France, 02/09/2013 . https://doi.org/10.1007/978-3-642-40450-4_6
Arge, L, Brodal, G S, Truelsen, J & Tsirogiannis, C 2013, ' An optimal and practical cache-oblivious algorithm for computing multiresolution rasters ' . in Algorithms – ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings . Springer-VS, pp. 61-72 . Lecture Notes in Computer Science, vol. 8125,, 10.1007/978-3-642-40450-4_6

n many scientific applications it is required to reconstruct a raster dataset many times, each time using a different resolution. This leads to the following problem; let G be a raster of N−−√ x N−−√ cells. We want to compute for every in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6d162affad556ae4deab04caefa82a27
https://pure.au.dk/portal/da/publications/an-optimal-and-practical-cacheoblivious-algorithm-for-computing-multiresolution-rasters(f30c207d-dd3c-4044-88cd-164cc1cd6ad9).html