关注
David F Shallcross
David F Shallcross
Peraton Labs
在 jhu.edu 的电子邮件经过验证
标题
引用次数
引用次数
年份
Methods for designing communications networks with certain two-connected survivability constraints
CL Monma, DF Shallcross
Operations Research 37 (4), 531-541, 1989
2771989
Large travelling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation
RG Bland, DF Shallcross
Operations Research Letters 8 (3), 125-128, 1989
2511989
Distance realization problems with applications to internet tomography
F Chung, M Garrett, R Graham, D Shallcross
Journal of Computer and System Sciences 63 (3), 432-448, 2001
862001
A polynomial algorithm for a one machine batching problem
DF Shallcross
Operations Research Letters 11 (4), 213-218, 1992
841992
An implementation of the generalized basis reduction algorithm for integer programming
W Cook, T Rutherford, HE Scarf, D Shallcross
ORSA Journal on Computing 5 (2), 206-212, 1993
811993
Practical issues and algorithms for analyzing terrorist networks
T Carpenter, G Karakostas, D Shallcross
Proceedings of the western simulation multiconference, 2002
642002
Network science based approaches to design and analyze MANETs for military applications
L Kant, K Young, O Younis, D Shallcross, K Sinkar, A Mcauley, ...
IEEE Communications Magazine 46 (11), 55-61, 2008
372008
Method and system for design and routing in transparent optical networks
T Carpenter, D Shallcross, J Gannett, J Jackel, A Von Lehmen
US Patent 7,286,480, 2007
342007
Cognitive tactical network models
O Younis, L Kant, A McAuley, K Manousakis, D Shallcross, K Sinkar, ...
IEEE Communications Magazine 48 (10), 70-77, 2010
312010
The Frobenius problem and maximal lattice free bodies
HE Scarf, DF Shallcross
Mathematics of Operations Research 18 (3), 511-515, 1993
301993
Maximizing the transparency advantage in optical networks
T Carpenter, D Shallcross, J Gannett, J Jackel, A Von Lehmen
Optical Fiber Communication Conference, FA2, 2003
262003
Algorithms for flow allocation for multi protocol label switching
T Ott, T Bogovic, T Carpenter, KR Krishnan, D Shallcross
MPLS International Conference (October 2000), 2001
252001
Method for systematic modeling and evaluation of application flows
BW Falchuk, KR Krishnan, SK Loeb, DF Shallcross
US Patent 8,554,825, 2013
242013
Cost-conscious impairment-aware routing
TJ Carpenter, RC Menendez, DF Shallcross, JW Gannett, J Jackel, ...
Optical Fiber Communication Conference, MF88, 2004
222004
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
M Mihail, D Shallcross, N Dean, M Mostrel
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms …, 1996
221996
Network restoration under a single link or node failure using preconfigured virtual cycles
MI Eiger, H Luss, DF Shallcross
Telecommunication Systems 46 (1), 17-30, 2011
202011
Node placement and sizing for copper broadband access networks
T Carpenter, M Eiger, D Shallcross, P Seymour
Annals of Operations Research 106 (1), 199-228, 2001
172001
Centralized multi-scale singular value decomposition for feature construction in LIDAR image classification problems
D Bassu, R Izmailov, A McIntosh, L Ness, D Shallcross
2012 IEEE Applied Imagery Pattern Recognition Workshop (AIPR), 1-6, 2012
152012
Network restoration under dual failures using path-protecting preconfigured cycles
MI Eiger, H Luss, DF Shallcross
Telecommunication Systems 49 (3), 271-286, 2012
152012
C-NEDAT: A cognitive network engineering design analytic toolset for MANETs
L Kant, A McAuley, K Manousakis, D Shallcross, K Sinkar, M Tauil, ...
2010-MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE, 2333-2338, 2010
152010
系统目前无法执行此操作,请稍后再试。
文章 1–20