2233 search results - page 232 / 447 » On the Complexity of Theory Curbing |
146
click to vote
VSTTE
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Many well-established concepts of object-oriented programming work for individual objects, but do not support object structures. The development of a verifying compiler r...
167
click to vote
DIALM
2004
ACM
16 years 1 hour ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
193
click to vote
PEWASUN
2004
ACM
15 years 12 months ago
2004
ACM
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
179
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
180
click to vote
HYBRID
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...