Sciweavers

519 search results - page 1 / 104
» Upper Bounds on the Computational Power of an Optical Model ...
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
UC
2005
Springer
13 years 10 months ago
Lower Bounds on the Computational Power of an Optical Model of Computation
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Damien Woods, J. Paul Gibson
SPDP
1990
IEEE
13 years 8 months ago
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Akhilesh Tyagi, John H. Reif
GLOBECOM
2006
IEEE
13 years 10 months ago
Link Performance Bounds in Homogeneous Optically Switched Ring Networks
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
Shujia Gong, Bijan Jabbari
COR
2008
175views more  COR 2008»
13 years 4 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...