Sciweavers

356 search results - page 29 / 72
» Parallelizing time with polynomial circuits
Sort
View
COMSWARE
2007
IEEE
14 years 3 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
ISTCS
1993
Springer
14 years 1 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
IPPS
2003
IEEE
14 years 2 months ago
Parallel Tabu Search in a Heterogeneous Environment
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposit...
Ahmad A. Al-Yamani, Sadiq M. Sait, Hassan Barada, ...
CONCUR
2008
Springer
13 years 11 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
PARLE
1987
14 years 19 days ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch