Sciweavers

2163 search results - page 351 / 433
» cases 2004
Sort
View
SBBD
2004
103views Database» more  SBBD 2004»
14 years 11 months ago
Modelagem de Bibliotecas Digitais usando a Abordagem 5S: Um Estudo de Caso
An enormous amount of information is currently available through specialized services of digital libraries (DLs). However the specification and development of DLs are very complex...
David Patricio Viscarra del Pozo, Lena Veiga e Sil...
SERP
2004
14 years 11 months ago
Locating Features in Distributed Systems
In distributed systems, just as in conventional software, it is often necessary to locate the software components that implement a particular user feature. Several dynamic analysi...
Sharon Simmons, Dennis Edwards, Norman Wilde
SIROCCO
2004
14 years 11 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
14 years 11 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 11 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...