Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Report
|
Understanding Consistency Maintenance in Service Discovery Architectures in Response to Message LossDabrowski, Christopher ; Mills, Kevin ; Elder, Jesse2002Texto completo disponível |
|
2 |
Material Type: Report
|
Kursmaterialien Schnupperstudium InformatikBröker, Oliver ; Neyer, Gabriele ; Sleumer, NoraETH Zurich 2000Texto completo disponível |
|
3 |
Material Type: Report
|
Automated analysis of dynamic web servicesBoustedt, JonasUppsala universitet, Datorteknik 2002Texto completo disponível |
|
4 |
Material Type: Report
|
Two Adversary Lower Bounds for Parity GamesBjörklund, Henrik ; Vorobyov, SergeiUppsala universitet, Institutionen för informationsteknologi 2002Texto completo disponível |
|
5 |
Material Type: Report
|
Optimization on Completely Unimodal HypercubesBjörklund, Henrik ; Vorobyov, Sergei ; Sandberg, SvenUppsala universitet, Institutionen för informationsteknologi 2002Texto completo disponível |
|
6 |
Material Type: Report
|
BioOpera: Managing large-scale computations in bioinformaticsAlonso, Gustavo ; Bausch, Win ; Hallett, M.T. ; Kahn, A. ; Pautasso, CesareETH Zurich 2000Texto completo disponível |
|
7 |
Material Type: Report
|
Adapting Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games: Implementation and ExperimentationBeffara, Emmanuel ; Vorobyov, SergeiUppsala universitet, Institutionen för informationsteknologi 2001Texto completo disponível |
|
8 |
Material Type: Report
|
Dynamic structured grid hierarchy partitioners using inverse space-filling curvesSteensland, JohanUppsala universitet, Avdelningen för teknisk databehandling 2001Texto completo disponível |
|
9 |
Material Type: Report
|
Parity games : interior-point approachPetersson, Viktor ; Vorobyov, SergeiUppsala universitet, Institutionen för informationsteknologi 2001Texto completo disponível |
|
10 |
Material Type: Report
|
Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial?Beffara, Emmanuel ; Vorobyov, SergeiUppsala universitet, Institutionen för informationsteknologi 2001Texto completo disponível |