4679 search results - page 136 / 936 » Modeling When Connections Are the Problem |
104
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
107
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
106
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for comme...
98
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
111
click to vote
SIGMETRICS
2000
ACM
15 years 1 months ago
2000
ACM
The most common problem of an overloaded electronic-commerce server is an increase in the response time perceived by customers, who may restart their requests hoping to get a fast...