Results 271 to 280 of about 254,408 (315)

A graph-based approach to variant description extraction from sequences. [PDF]

open access: yesNAR Genom Bioinform
Santcroos MA   +4 more
europepmc   +1 more source

Adaptive planning depth in human problem-solving. [PDF]

open access: yesR Soc Open Sci
Eluchans M   +5 more
europepmc   +1 more source

On open shortest path first related network optimisation problems

Performance Evaluation, 2002
The paper deals with flow allocation problems in IP networks using Open Shortest Path First (OSPF) routing. Its main purpose is to discuss and propose methods for finding settlements of OSPF link weight system realising the assumed demand pattern for the given network resources (links capacities).
Pióro, M.   +5 more
openaire   +1 more source

Vulnerabilities in the open shortest path first interior gateway protocol

MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155), 2002
In order to reduce the number of successful attacks against the US government's computer networks, resources must be invested not only into implementing known fixes and security measures but also into the identification and correction of vulnerabilities before adversaries can exploit them.
J.C. McEachen, R.L. Chesser
openaire   +1 more source

Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First

International Journal of Computer Science and Application, 2014
In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED).
J. Kavitha, S. Palaniammal
openaire   +1 more source

Home - About - Disclaimer - Privacy