Sciweavers

8766 search results - page 1689 / 1754
» Functional logic programming
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
NOMS
2000
IEEE
176views Communications» more  NOMS 2000»
14 years 1 months ago
Design and analysis of a proactive application management system (PAMS)
Management of large-scale Network-Centric Systems (NCS) and their applications is an extremely complex and challenging task due to factors such as centralized management architect...
Salim Hariri, Yoonhee Kim
CP
2000
Springer
14 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
STACS
1999
Springer
14 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
14 years 1 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...
« Prev « First page 1689 / 1754 Last » Next »