539 search results - page 44 / 108 » The N R One Time Password System |
166
click to vote
QEST
2009
IEEE
16 years 24 days ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
146
click to vote
ISPD
2000
ACM
15 years 10 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
168
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
154
click to vote
ESA
2009
Springer
16 years 19 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
153
click to vote
CLUSTER
2006
IEEE
2006
IEEE
A flexible multi-dimensional QoS performance measure framework for distributed heterogeneous systems
15 years 6 months ago
When users' tasks in a distributed heterogeneous computing environment (e.g., cluster of heterogeneous computers) are allocated resources, the total demand placed on some sys...