2585 search results - page 353 / 517 » computing 1999 |
123
click to vote
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Matrix-implicit Krylov-subspace methods have made it possible to efficiently compute the periodic steady-state of large circuits using either the time-domain shooting-Newton metho...
167
click to vote
HICSS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we motivate the importance of the field of mobile computing and survey current practical and formal approaches. We argue that the existing formalisms are not suffic...
131
click to vote
EDCC
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
116
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
168
click to vote
HIPC
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...