Sciweavers

7544 search results - page 1318 / 1509
» Network Forensics Analysis
Sort
View
JSA
2000
115views more  JSA 2000»
15 years 4 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
NN
2000
Springer
170views Neural Networks» more  NN 2000»
15 years 4 months ago
Synthetic brain imaging: grasping, mirror neurons and imitation
The article contributes to the quest to relate global data on brain and behavior (e.g. from PET, Positron Emission Tomography, and fMRI, functional Magnetic Resonance Imaging) to ...
Michael A. Arbib, Aude Billard, Marco Iacoboni, Er...
INFOCOM
2010
IEEE
15 years 3 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
JSAC
2010
101views more  JSAC 2010»
15 years 3 months ago
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
Michael P. McGarry, Martin Reisslein, Frank Aurzad...
WABI
2010
Springer
167views Bioinformatics» more  WABI 2010»
15 years 3 months ago
Quantifying the Strength of Natural Selection of a Motif Sequence
Quantification of selective pressures on regulatory sequences is a central question in studying the evolution of gene regulatory networks. Previous methods focus primarily on sing...
Chen-Hsiang Yeang
« Prev « First page 1318 / 1509 Last » Next »