Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=361
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Subthreshold-seeking local search
Darrell Whitley
,
Jonathan Rowe
Theoretical Computer Science
361
(1), 2006, pp. 2-17
Weighted multirecombination evolution strategies
Dirk V. Arnold
Theoretical Computer Science
361
(1), 2006, pp. 18-37
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
Jens Jägersküpper
Theoretical Computer Science
361
(1), 2006, pp. 38-56
Compact representations as a search strategy: Compression EDAs
Marc Toussaint
Theoretical Computer Science
361
(1), 2006, pp. 57-71
Some results about the Markov chains associated to GPs and general EAs
Boris Mitavskiy
,
Jonathan Rowe
Theoretical Computer Science
361
(1), 2006, pp. 72-110
Differentiable coarse graining
Jonathan E. Rowe
,
Michael D. Vose
,
Alden H. Wright
Theoretical Computer Science
361
(1), 2006, pp. 111-129
Minimum sum multicoloring on the edges of trees
Dániel Marx
Theoretical Computer Science
361
(2-3), 2006, pp. 133-149
Efficient approximation algorithms for the achromatic number
Piotr Krysta
,
Krzysztof Loryś
Theoretical Computer Science
361
(2-3), 2006, pp. 150-171
Correlation clustering in general weighted graphs
Erik D. Demaine
,
Dotan Emanuel
,
Amos Fiat
,
Nicole Immorlica
Theoretical Computer Science
361
(2-3), 2006, pp. 172-187
Asymmetry in
k
-center variants
Inge Li Grtz
,
Anthony Wirth
Theoretical Computer Science
361
(2-3), 2006, pp. 188-199
Tradeoffs in worst-case equilibria
Baruch Awerbuch
,
Yossi Azar
,
Yossi Richter
,
Dekel Tsur
Theoretical Computer Science
361
(2-3), 2006, pp. 200-209
A PTAS for the minimization of polynomials of fixed degree over the simplex
Etienne de Klerk
,
Monique Laurent
,
Pablo A. Parrilo
Theoretical Computer Science
361
(2-3), 2006, pp. 210-225
A
\frac{5}{4}
-approximation algorithm for scheduling identical malleable tasks
T. Decker
,
T. Lücking
,
B. Monien
Theoretical Computer Science
361
(2-3), 2006, pp. 226-240
On the relationship between combinatorial and LP-based lower bounds for
NP
-hard scheduling problems
R.N. Uma
,
Joel Wein
,
David P. Williamson
Theoretical Computer Science
361
(2-3), 2006, pp. 241-256
Open block scheduling in optical communication networks
A.A. Ageev
,
A.V. Fishkin
,
A.V. Kononov
,
S.V. Sevastyanov
Theoretical Computer Science
361
(2-3), 2006, pp. 257-274
Incremental algorithms for Facility Location and
k
-median
Dimitris Fotakis
Theoretical Computer Science
361
(2-3), 2006, pp. 275-313
Load balancing of temporary tasks in the
l_p
norm
Yossi Azar
,
Amir Epstein
,
Leah Epstein
Theoretical Computer Science
361
(2-3), 2006, pp. 314-328
How to whack moles
Sandra Gutiérrez
,
Sven O. Krumke
,
Nicole Megow
,
Tjark Vredeveld
Theoretical Computer Science
361
(2-3), 2006, pp. 329-341
Online searching with turn cost
Erik D. Demaine
,
Sandor P. Fekete
,
Shmuel Gal
Theoretical Computer Science
361
(2-3), 2006, pp. 342-355