Titlebook: Optical Supercomputing; Third International Shlomi Dolev,Mihai Oltean Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2

Precise

書目名稱Optical Supercomputing影響因子(影響力)




書目名稱Optical Supercomputing影響因子(影響力)學(xué)科排名




書目名稱Optical Supercomputing網(wǎng)絡(luò)公開度




書目名稱Optical Supercomputing網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Optical Supercomputing被引頻次




書目名稱Optical Supercomputing被引頻次學(xué)科排名




書目名稱Optical Supercomputing年度引用




書目名稱Optical Supercomputing年度引用學(xué)科排名




書目名稱Optical Supercomputing讀者反饋




書目名稱Optical Supercomputing讀者反饋學(xué)科排名

Vital-Signs

faultfinder

Optical Graph 3-Colorability,using at most three colors, satisfying the condition that every two adjacent vertices have different colors. It has been proved that the graph 3-colorability problem belongs to NP-complete class of problems which no polynomial resources solution is found for them yet..In this paper, a novel optical

ADOPT

NUL

Simulation and Optimized Design of High Density Optical Crossconnect Systems for Massively Parallel. Using the 3D nature of free-space optics, this approach is able to solve geometrical problems with static crossings of the signal paths that occur in waveguide optical and electrical interconnection, especially for large number of connections.

脾氣暴躁的人

An Optical Solution for the SAT Problem,rder to generate a solution. The device has 2 special nodes: a start node (where the initial pulse is sent) and a destination node (where the solution is read). Multiple signals are expected at the destination. Some of them contain valid solutions and others do not. A special, time filter, is propos

愚蠢人

GROUP

Optics Goes Where No Electronics Can Go: Zero-Energy-Dissipation Logic, digital over analog processing make pure electronics superior in almost every case. Optical computing uses come when the signal is already in the optical domain or when it is used to reduce the heat load in hybrid optical-electronic chips. I describe here work done with a number of bright opticists

戲法

Holographic Computation of Balanced Succinct Permanent Instances, complexity results for various decision problems on graph properties, when the graph is given in a succinct representation. Later, Papadimitriou and Yannakakis showed, that under the same succinct encoding method, certain class of decision problems on graph properties becomes exponentially hard. In

tangle