Sciweavers

4744 search results - page 114 / 949
» Connected Computing
Sort
View
ENTCS
2007
86views more  ENTCS 2007»
15 years 3 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée
171
Voted
WOSP
2004
ACM
15 years 8 months ago
Computing the performability of layered distributed systems with a management architecture
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
Olivia Das, C. Murray Woodside
JAIR
2008
123views more  JAIR 2008»
15 years 3 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
JC
2007
130views more  JC 2007»
15 years 2 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
CN
2008
118views more  CN 2008»
15 years 3 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso