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=International Journal of Foundations of Computer Science AND Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Clustering Web visitors by fast, robust and convergent algorithms
Vladimir Estivill-Castro
,
Jianhua Yang
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 497-520
A dynamcic recommendation system based on log mining
Wen Gao
,
Shi Wang
,
Bin Liu
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 521-530
An intelligent agent for Web advertisements
Vincent Ng
,
Mok Kwan Ho
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 531-554
Representation and construction of ontologies for Web intelligence
Ning Zhong
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 555-570
MONA implementation secrets
Nils Klarlund
,
Anders Mller
,
Michael I. Schwartzbach
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 571-586
Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit
Jürgen Schmidhuber
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 587-612
Approximation algorithms for scheduling malleable tasks under precedence constraints
Renaud Lepère
,
Denis Trystram
,
Gerhard J. Woeginger
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 613-627
On the complexity of computing values of restricted games
J.M. Bilbao
,
J.R. Fernández
,
J.J. López
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 633-651
Linear and integer programming techniques for cooperative games
Qizhi Fang
,
Shanfeng Zhu
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 653-666
On computational complexity of hierarchical optimization
Weijia Jia
,
Zhibin Sun
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 667-670
Complexity of scenario-based portfolio optimization problem with VaR objecitve
Xiaoguang Yang
,
Shuo Tao
,
Rongjun Liu
,
Maocheng Cai
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 671-679
Computational complexity of arbitrage in frictional security market
Xiaotie Deng
,
Zhong-Fei Li
,
Shou-Yang Wang
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 681-684
A novel numerical approach of computing American option
Jiwu Shu
,
Yonggeng Gu
,
Weimin Zheng
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 685-693
Efficient solution to uniform atomic broadcast
Emmanuelle Anceaume
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 695-717
A formula-driven modular attack on state explosion
Nicoletta De Francesco
,
Antonella Santone
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 719-731
Parallel finite automata systems communicating by states
Carlos Martín-Vide
,
Alexandru Mateescu
,
Victor Mitrana
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 733-749
Approximation algorithms for local alignment with length constraints
Abdullah N. Arslan
,
Ömer Eğecioğlu
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 751-767
Remarks concerning the D0L
\omega
-equivalence problem
Juha Honkala
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 769-777
Computing by communication in networks of membranes
Andrei Păun
,
Gheorghe Păun
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 779-798
Shuffle decompositions of regular languages
C. Câmpeanu
,
K. Salomaa
,
S. Vágvölgyi
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 799-816
A PTAS for minimizing total completion time of bounded batch scheduling
Xiaotie Deng
,
Haodi Feng
,
Guojun Li
,
Guizhen Liu
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 817-827
On universally polynomial context-free languages
Nicholastran Tran
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 829-835
Constructing red-black tree shapes
Andrea Mantler
,
Helen Cameron
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 837-863
A note on the determination of the immediate predecessors in a distributed computation
Emmanelle Anceaume
,
Jean-Michel Helary
,
Michel Raynal
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 865-872
Pattern matching code minimization in rewriting-based programming languages
Nadia Nedjah
,
Luiza de Macedo Mourelle
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 873-887
Seiten
<
1
2
3
>