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=Inf.~Process.~Lett. AND Volume=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Evolutionary computing
A.E. Eiben
,
M. Schoenauer
Information Processing Letters
82
(1), 2002, pp. 1-6
Parallel evolutionary algorithms can achieve super-linear performance
Enrique Alba
Information Processing Letters
82
(1), 2002, pp. 7-13
Order statistics and selection methods
Erick Cantú-Paz
Information Processing Letters
82
(1), 2002, pp. 15-22
Learning classifier systems: New models, successful applications
John H. Holmes
,
Pier Luca Lanzi
,
Wolfgang Stolzmann
,
Stewart W. Wilson
Information Processing Letters
82
(1), 2002, pp. 23-30
Evolutionary induced decision trees for dangerous software modules prediction
Vili Podgorelec
,
Peter Kokol
Information Processing Letters
82
(1), 2002, pp. 31-38
Evolutionary local search for the edge-biconnectivity augmentation problem
Günther R. Raidl
,
Ivana Ljubić
Information Processing Letters
82
(1), 2002, pp. 39-45
Parallel genetic algorithm with parameter adaptation
Shisanu Tongchim
,
Prabhas Chongstitvatana
Information Processing Letters
82
(1), 2002, pp. 47-54
Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound
Anjan Kumar Swain
,
Alan S. Morris
Information Processing Letters
82
(1), 2002, pp. 55-63
Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
Keon-Jik Lee
,
Kee-Won Kim
,
Kee-Young Yoo
Information Processing Letters
82
, 2002, pp. 65-71
Parallel distance transforms on a linear array architecture
Tsorng-Lin Chia
,
Kuang-Bor Wang
,
Zen Chen
,
Der-Chyuan Lou
Information Processing Letters
82
, 2002, pp. 73-81
On scheduling send-graphs and receive-graphs under the LogP-model
W. Zimmermann
,
W. Löwe
,
D. Trystram
Information Processing Letters
82
, 2002, pp. 83-92
Optimizing a mail-order discount and shipping costs
Peter Damaschke
Information Processing Letters
82
, 2002, pp. 93-97
Approximation algorithms for terrain guarding
Stephan Eidenbenz
Information Processing Letters
82
, 2002, pp. 99-105
Scheduling with job release dates, delivery times and preemption penalties
Zhaohui Liu
,
T.C. Edwin Cheng
Information Processing Letters
82
, 2002, pp. 107-111
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Jianxi Fan
Information Processing Letters
82
, 2002, pp. 113-117
On
\alpha
-redundant vertices in
P_5
-free graphs
Andreas Brandstädt
,
Hoàng-Oanh Le
,
Van Bang Le
Information Processing Letters
82
, 2002, pp. 119-122
Quantified computation tree logic
A.C. Patthak
,
I. Bhattacharya
,
A. Dasgupta
,
Pallab Dasgupta
,
P.P. Chakrabarti
Information Processing Letters
82
, 2002, pp. 123-129
On vertex ranking of a starlike graph
Sun-yuan Hsieh
Information Processing Letters
82
, 2002, pp. 131-135
The Traveling Salesman problem for lines in the plane
Håkan Jonsson
Information Processing Letters
82
, 2002, pp. 137-142
Solving a system of difference constraints with variables restricted to a finite set
John P. Fishburn
Information Processing Letters
82
, 2002, pp. 143-144
ACO algorithms with guaranteed convergence to the optimal solution
Walter J. Gutjahr
Information Processing Letters
82
, 2002, pp. 145-153
An exponential gap with the removal of one negation gate
Shao-Chin Sung
,
Keisuke Tanaka
Information Processing Letters
82
, 2002, pp. 155-157
Partition-distance: A problem and class of perfect graphs arising in clustering
Dan Gusfield
Information Processing Letters
82
, 2002, pp. 159-164
On characterizing the existence of partial one-way permutations
Jörg Rothe
,
Lane A. Hemaspaandra
Information Processing Letters
82
, 2002, pp. 165-171
Some remarks on distributed depth-first search
Y.H. Tsin
Information Processing Letters
82
, 2002, pp. 173-178
Seiten 1
2
>