2008 |
33 | EE | Artur Andrzejak,
Derrick Kondo,
David P. Anderson:
Ensuring Collective Availability in Volatile Resource Pools Via Forecasting.
DSOM 2008: 149-161 |
32 | EE | Derrick Kondo,
Artur Andrzejak,
David P. Anderson:
On correlated availability in Internet-distributed systems.
GRID 2008: 276-283 |
31 | EE | Artur Andrzejak,
Luis Silva:
Using machine learning for non-intrusive modeling and prediction of software aging.
NOMS 2008: 25-32 |
2007 |
30 | EE | Artur Andrzejak,
Monika Moser,
Luís Moura Silva:
Managing Performance of Aging Applications Via Synchronized Replica Rejuvenation.
DSOM 2007: 98-109 |
29 | EE | Rosa M. Badia,
Christian Pérez,
Artur Andrzejak,
Alvaro Arenas:
Topic 6 Grid and Cluster Computing.
Euro-Par 2007: 359 |
28 | EE | Javier Alonso,
Luís Moura Silva,
Artur Andrzejak,
Paulo Silva,
Jordi Torres:
High-available grid services through the use of virtualized clustering.
GRID 2007: 34-41 |
27 | EE | Artur Andrzejak,
Luís Moura Silva:
Deterministic Models of Software Aging and Optimal Rejuvenation Schedules.
Integrated Network Management 2007: 159-168 |
26 | EE | Luís Moura Silva,
Javier Alonso,
Paulo Silva,
Jordi Torres,
Artur Andrzejak:
Using Virtualization to Improve Software Rejuvenation.
NCA 2007: 33-44 |
25 | EE | Artur Andrzejak,
Alexander Reinefeld:
Special section: Paradigms for scalable and dependable grids.
Future Generation Comp. Syst. 23(7): 861-863 (2007) |
2006 |
24 | EE | Artur Andrzejak,
Sven Graupner,
Stefan Plantikow:
Predicting Resource Demand in Dynamic Utility Computing Environments.
ICAS 2006: 6 |
23 | EE | Artur Andrzejak,
Patrício Domingues,
Luís Moura Silva:
Predicting Machine Availabilities in Desktop Pools.
NOMS 2006 |
22 | EE | Patrício Domingues,
Artur Andrzejak,
Luís Moura Silva:
Using Checkpointing to Enhance Turnaround Time on Institutional Desktop Grids.
e-Science 2006: 73 |
2005 |
21 | EE | Artur Andrzejak,
Ulf Hermann,
Akhil Sahai:
FEEDBACKFLOW-An Adaptive Workflow Generator for Systems Management.
ICAC 2005: 335-336 |
20 | EE | Jerry Rolia,
Ludmila Cherkasova,
Martin F. Arlitt,
Artur Andrzejak:
A capacity management service for resource pools.
WOSP 2005: 229-237 |
19 | | Artur Andrzejak,
Mehmet Ceyran:
Characterizing and Predicting Resource Demand by Periodicity Mining.
J. Network Syst. Manage. 13(2): (2005) |
2004 |
18 | EE | Artur Andrzejak,
Mehmet Ceyran:
Predicting resource demand profiles by periodicity mining.
CLUSTER 2004: 482 |
17 | EE | Sven Graupner,
Artur Andrzejak,
Vadim E. Kotov,
Holger Trinks:
Adaptive Service Placement Algorithms for Autonomous Service Networks.
Engineering Self-Organising Systems 2004: 280-297 |
16 | EE | Li Xiao,
Xiaodong Zhang,
Artur Andrzejak,
Songqing Chen:
Building a Large and Efficient Hybrid Peer-to-Peer Internet Caching System.
IEEE Trans. Knowl. Data Eng. 16(6): 754-769 (2004) |
15 | EE | Jerry Rolia,
Xiaoyun Zhu,
Martin F. Arlitt,
Artur Andrzejak:
Statistical service assurances for applications in utility grid environments .
Perform. Eval. 58(2-3): 319-339 (2004) |
2003 |
14 | | Artur Andrzejak,
Komei Fukuda:
Debugging Distributed Computations by Reverse Search.
Applied Informatics 2003: 719-725 |
13 | EE | Jerry Rolia,
Artur Andrzejak,
Martin F. Arlitt:
Automating Enterprise Application Placement in Resource Utilities.
DSOM 2003: 118-129 |
12 | EE | Artur Andrzejak:
Memory-Efficient and Fast Enumeration of Global States.
IV 2003: 189-193 |
11 | EE | Sven Graupner,
Artur Andrzejak,
Vadim E. Kotov:
Visualizing Topology in Self-Organizing Management Overlays.
IV 2003: 200-205 |
10 | EE | Artur Andrzejak,
Emo Welzl:
In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions.
Discrete & Computational Geometry 29(1): 105-131 (2003) |
9 | EE | Sven Graupner,
Vadim E. Kotov,
Artur Andrzejak,
Holger Trinks:
Service-Centric Globally Distributed Computing.
IEEE Internet Computing 7(4): 36-43 (2003) |
2002 |
8 | EE | Artur Andrzejak,
Sven Graupner,
Vadim E. Kotov,
Holger Trinks:
Self-Organizing Control in Plantetary-Scale Computing.
CCGRID 2002: 359- |
7 | EE | Jerry Rolia,
Xiaoyun Zhu,
Martin F. Arlitt,
Artur Andrzejak:
Statistical Service Assurances for Applications in Utility Grid Environments.
MASCOTS 2002: 247-256 |
6 | EE | Artur Andrzejak,
Zhichen Xu:
Scalable, Efficient Range Queries for Grid Information Services.
Peer-to-Peer Computing 2002: 33-40 |
1999 |
5 | EE | Artur Andrzejak,
Komei Fukuda:
Optimization over k-set Polytopes and Efficient k-set Enumeration.
WADS 1999: 1-12 |
1998 |
4 | EE | Artur Andrzejak,
Boris Aronov,
Sariel Har-Peled,
Raimund Seidel,
Emo Welzl:
Results on k-Sets and j-Facets via Continuous Motion.
Symposium on Computational Geometry 1998: 192-199 |
3 | EE | Artur Andrzejak:
An algorithm for the Tutte polynomials of graphs of bounded treewidth.
Discrete Mathematics 190(1-3): 39-54 (1998) |
1997 |
2 | EE | Artur Andrzejak:
Introduction to Randomized Algorithms.
Lectures on Proof Verification and Approximation Algorithms 1997: 29-40 |
1 | EE | Artur Andrzejak:
Splitting Formulas for Tutte Polynomials.
J. Comb. Theory, Ser. B 70(2): 346-366 (1997) |