default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 361
Volume 361, Number 1, August 2006
- Michael D. Vose:
Preface. 1 - L. Darrell Whitley, Jonathan E. Rowe:
Subthreshold-seeking local search. 2-17 - Dirk V. Arnold
:
Weighted multirecombination evolution strategies. 18-37 - Jens Jägersküpper:
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. 38-56 - Marc Toussaint:
Compact representations as a search strategy: Compression EDAs. 57-71 - Boris Mitavskiy, Jonathan E. Rowe:
Some results about the Markov chains associated to GPs and general EAs. 72-110 - Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Differentiable coarse graining. 111-129
Volume 361, Numbers 2-3, September 2006
- Klaus Jansen, Roberto Solis-Oba:
Preface. 131-132
- Dániel Marx:
Minimum sum multicoloring on the edges of trees. 133-149 - Piotr Krysta, Krzysztof Lorys:
Efficient approximation algorithms for the achromatic number. 150-171 - Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica:
Correlation clustering in general weighted graphs. 172-187 - Inge Li Gørtz, Anthony Wirth:
Asymmetry in k-center variants. 188-199 - Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in worst-case equilibria. 200-209 - Etienne de Klerk, Monique Laurent, Pablo A. Parrilo:
A PTAS for the minimization of polynomials of fixed degree over the simplex. 210-225 - Thomas Decker, Thomas Lücking, Burkhard Monien:
A 5/4-approximation algorithm for scheduling identical malleable tasks. 226-240 - R. N. Uma, Joel Wein, David P. Williamson:
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. 241-256 - Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open block scheduling in optical communication networks. 257-274 - Dimitris Fotakis:
Incremental algorithms for Facility Location and k-Median. 275-313 - Yossi Azar, Amir Epstein, Leah Epstein:
Load balancing of temporary tasks in the lp norm. 314-328 - Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to whack moles. 329-341 - Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online searching with turn cost. 342-355
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-30 19:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
