Sciweavers

11151 search results - page 2167 / 2231
» On the Complexity of Model Expansion
Sort
View
MMB
1999
Springer
249views Communications» more  MMB 1999»
13 years 12 months ago
A Development Platform for the Design and Optimization of Mobile Radio Networks
The rapidly increasing traffic demand from mobile users forces network operators and service providers to extend and optimize existing networks as well as to plan entirely new mo...
Jürgen Deissner, Gerhard Fettweis, Jörg ...
RTSS
1998
IEEE
13 years 12 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
NPIV
1998
ACM
108views Visualization» more  NPIV 1998»
13 years 12 months ago
Visualization for situation awareness
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
C. M. Hoffman, Y.-J. Kim, R. P. Winkler, J. D. Wal...
SPAA
1998
ACM
13 years 12 months ago
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D...
WG
1998
Springer
13 years 12 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
« Prev « First page 2167 / 2231 Last » Next »