Sciweavers

1110 search results - page 100 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ATVA
2010
Springer
175views Hardware» more  ATVA 2010»
15 years 8 days ago
The Complexity of Codiagnosability for Discrete Event and Timed Systems
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
Franck Cassez
TCS
2010
14 years 5 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 5 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
AUSAI
2010
Springer
14 years 8 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
ISCC
2002
IEEE
144views Communications» more  ISCC 2002»
15 years 4 months ago
A hierarchical distributed protocol for MPLS path creation
Network service provisioning involves the control of network resources through signaling, routing and management protocols that achieve Quality of Service and Traffic Engineering ...
Mohamed El-Darieby, Dorina C. Petriu, Jerry Rolia