Results 271 to 280 of about 1,063,217 (316)
Some of the next articles are maybe not open access.
IEEE Internet Computing, 1998
VNC is an ultra thin client system based on a simple display protocol that is platform independent. It achieves mobile computing without requiring the user to carry any hardware. VNC provides access to home computing environments from anywhere in the world, on whatever computing infrastructure happens to be available-including, for example, public Web ...
Tristan Richardson +3 more
openaire +1 more source
VNC is an ultra thin client system based on a simple display protocol that is platform independent. It achieves mobile computing without requiring the user to carry any hardware. VNC provides access to home computing environments from anywhere in the world, on whatever computing infrastructure happens to be available-including, for example, public Web ...
Tristan Richardson +3 more
openaire +1 more source
Communications of the ACM, 1986
Computer networks are becoming more numerous and more diverse. Collectively, they constitute a worldwide metanetwork.
John S. Quarterman, Josiah C. Hoskins
openaire +1 more source
Computer networks are becoming more numerous and more diverse. Collectively, they constitute a worldwide metanetwork.
John S. Quarterman, Josiah C. Hoskins
openaire +1 more source
Operations Research, 1979
This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t, the probability that all operative node pairs can communicate, and the expected number of node pairs communicating ...
openaire +1 more source
This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t, the probability that all operative node pairs can communicate, and the expected number of node pairs communicating ...
openaire +1 more source
An introduction to network computers
Proceedings of the ACM '82 conference on - ACM 82, 1982Low cost, compactness, and surprising compute power combine to make microprocessor computing elements attractive as building blocks for large parallel computers. Many applications ranging from brain simulation to real-time traffic control can be solved by using inherently parallel techniques executing on loosely-coupled ensembles of microcomputers ...
Larry D. Wittie, André M. Van Tilborg
openaire +1 more source
Networks, 1971
AbstractThe problem of routing flow in a network of computers is extremely complex. This is especially formidable when routing is to be incorporated in iterative analysis and design. Among the properties of desirable flow patterns is low average delay from message inception to arrival.
Howard Frank, Wushow Chou
openaire +1 more source
AbstractThe problem of routing flow in a network of computers is extremely complex. This is especially formidable when routing is to be incorporated in iterative analysis and design. Among the properties of desirable flow patterns is low average delay from message inception to arrival.
Howard Frank, Wushow Chou
openaire +1 more source
Computer Networks As Social Networks
Science, 2001Computer networks are inherently social networks, linking people, organizations, and knowledge. They are social institutions that should not be studied in isolation but as integrated into everyday lives. The proliferation of computer networks has facilitated a deemphasis on group solidarities at work and in the community and afforded a turn to ...
openaire +2 more sources
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006
We introduce a simple new model of distributed computation -- finite-state symmetric graph automata (FSSGA) -- which captures the qualitative properties common to fault-tolerant distributed algorithms. Roughly speaking, the computation evolves homogeneously in the entire network, with each node acting symmetrically and with limited resources.
David Pritchard 0001, Santosh S. Vempala
openaire +1 more source
We introduce a simple new model of distributed computation -- finite-state symmetric graph automata (FSSGA) -- which captures the qualitative properties common to fault-tolerant distributed algorithms. Roughly speaking, the computation evolves homogeneously in the entire network, with each node acting symmetrically and with limited resources.
David Pritchard 0001, Santosh S. Vempala
openaire +1 more source
2013
"Computing Networks" explores the core of the new distributed computing infrastructures we are using today: the networking systems of clusters, grids and clouds. It helps network designers and distributed-application developers and users to better understand the technologies, specificities, constraints and benefits of these different infrastructures ...
Vicat-Blanc Primet, Pascale +3 more
openaire +2 more sources
"Computing Networks" explores the core of the new distributed computing infrastructures we are using today: the networking systems of clusters, grids and clouds. It helps network designers and distributed-application developers and users to better understand the technologies, specificities, constraints and benefits of these different infrastructures ...
Vicat-Blanc Primet, Pascale +3 more
openaire +2 more sources
Future Generation Computer Systems, 1991
Abstract In this paper, we give a general presentation of neural networks, showing their links and differences with Artificial Intelligence and neurosciences. We provide the general formalism of neural networks and describe two neural networks learning algorithms: gradient backpropagation and learning vector quantization.
openaire +1 more source
Abstract In this paper, we give a general presentation of neural networks, showing their links and differences with Artificial Intelligence and neurosciences. We provide the general formalism of neural networks and describe two neural networks learning algorithms: gradient backpropagation and learning vector quantization.
openaire +1 more source
Proceedings of ICNN'95 - International Conference on Neural Networks, 2002
In this paper, we discuss an approach for designing the computational neural network, which is mainly composed of a hardlimiter neuron, a updated neuron, and a search function neuron, to solve some computational problems. The computation-by-search scheme can effectively solve some complicated problems in the condition that their search functions can be
Jar-Ferr Yang, Chi-Ming Chen
openaire +1 more source
In this paper, we discuss an approach for designing the computational neural network, which is mainly composed of a hardlimiter neuron, a updated neuron, and a search function neuron, to solve some computational problems. The computation-by-search scheme can effectively solve some complicated problems in the condition that their search functions can be
Jar-Ferr Yang, Chi-Ming Chen
openaire +1 more source