Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Schweer, Nils"'
We consider the following online allocation problem: Given a unit square S, and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1; at each step i, select a region C_i of previously unassigned area n_i in S. The objective is to
Externí odkaz:
http://arxiv.org/abs/1304.5971
In this paper we consider methods for dynamically storing a set of different objects ("modules") in a physical array. Each module requires one free contiguous subinterval in order to be placed. Items are inserted or removed, resulting in a fragmented
Externí odkaz:
http://arxiv.org/abs/1101.5407
Autor:
Fekete, Sandor, Kamphans, Tom, Schweer, Nils, Tessars, Christopher, van der Veen, Jan C., Angermeier, Josef, Koch, Dirk, Teich, Juergen
We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our method is ba
Externí odkaz:
http://arxiv.org/abs/1012.5330
We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from above, one at a time. The objective is to pack these items as they arri
Externí odkaz:
http://arxiv.org/abs/1010.4502
Autor:
Demaine, Erik D., Fekete, Sandor P., Rote, Guenter, Schweer, Nils, Schymura, Daria, Zelke, Mariano
Publikováno v:
Computational Geometry, Theory and Applications 44 (2011), 82-94
An n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape i
Externí odkaz:
http://arxiv.org/abs/1009.5628
Every year, the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a single reconfigurable device. In this paper, we present a concept for multi
Externí odkaz:
http://arxiv.org/abs/1001.4493
Publikováno v:
In Theoretical Computer Science 23 October 2014 555:43-54
Autor:
Demaine, Erik D., Fekete, Sándor P., Rote, Günter, Schweer, Nils, Schymura, Daria, Zelke, Mariano
Publikováno v:
In Computational Geometry: Theory and Applications 2011 44(2):82-94
Autor:
Schweer, Nils
Packing problems belong to the most frequently studied problems in combinatorial optimization. Mainly, the task is to pack a set of small objects into a large container. These kinds of problems, though easy to state, are usually hard to solve. An add
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a85e52b5a0f307724208d3a66a34ebd1
https://leopard.tu-braunschweig.de/receive/dbbs_mods_00032779
https://leopard.tu-braunschweig.de/receive/dbbs_mods_00032779