Sciweavers

6437 search results - page 887 / 1288
» Parallel Algorithms for Arrangements
Sort
View
BIRTHDAY
2010
Springer
15 years 8 months ago
Three Paths to Effectiveness
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
Udi Boker, Nachum Dershowitz
COR
2010
123views more  COR 2010»
15 years 6 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
169
Voted
CORR
2008
Springer
135views Education» more  CORR 2008»
15 years 6 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
Thomas Thierauf, Fabian Wagner
ENTCS
2002
98views more  ENTCS 2002»
15 years 6 months ago
Verified Code Generation for Embedded Systems
Digital signal processors provide specialized SIMD (single instruction multiple data) operations designed to dramatically increase performance in embedded systems. While these ope...
Sabine Glesner, Rubino Geiß, Boris Boesler
GLOBECOM
2010
IEEE
15 years 4 months ago
Energy-Efficient Multi-Carrier Link Adaptation with Sum Rate-Dependent Circuit Power
Abstract--Energy-efficient link adaptation is studied for transmission on a frequency-selective parallel AWGN channel. The total power dissipation model includes a circuit power th...
Christian Isheden, Gerhard Fettweis