7587 search results - page 1368 / 1518 » Network Analysis and Visualisation |
HPDC
1999
IEEE
14 years 10 days ago
1999
IEEE
While there have been several proposals of high performance global computing systems, scheduling schemes for the systems have not been well investigated. The reason is difficultie...
COMPULOG
1999
Springer
14 years 9 days ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
LICS
1999
IEEE
14 years 9 days ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
14 years 8 days ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
RTSS
1998
IEEE
14 years 8 days ago
1998
IEEE
Previous ultra-dependable real-time computing architectures have been specialised to meet the requirements of a particular application domain. Over the last two years, a consortiu...