Sciweavers

5334 search results - page 602 / 1067
» Communicating quantum processes
Sort
View
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 8 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
PDPTA
2000
15 years 8 months ago
On the application of accelerating simulation methods in network analysis
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...
José Incera, Gerardo Rubino, Nicolás...
FMICS
2010
Springer
15 years 8 months ago
SMT-Based Formal Verification of a TTEthernet Synchronization Function
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
Wilfried Steiner, Bruno Dutertre
GLOBECOM
2008
IEEE
15 years 8 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
SIGCOMM
2010
ACM
15 years 7 months ago
On-line consistent backup in transactional file systems
A consistent backup, preserving data integrity across files in a file system, is of utmost importance for the purpose of correctness and minimizing system downtime during the proc...
Lipika Deka, Gautam Barua