Sciweavers

370 search results - page 49 / 74
» Bounded modified realizability
Sort
View
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan
INFOCOM
2000
IEEE
14 years 1 months ago
Wavelength Assignment in WDM Rings to Minimize SONET ADMs
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
Liwu Liu, Xiang-Yang Li, Peng-Jun Wan, Ophir Fried...
CONCUR
2000
Springer
14 years 1 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ICCAD
1998
IEEE
93views Hardware» more  ICCAD 1998»
14 years 28 days ago
Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation
This paper considers simultaneous gate and wire sizing for general very large scale integrated (VLSI) circuits under the Elmore delay model. We present a fast and exact algorithm w...
Chung-Ping Chen, Chris C. N. Chu, D. F. Wong
IPPS
1998
IEEE
14 years 28 days ago
An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
Sylvain Lauzac, Rami G. Melhem, Daniel Mossé...