Assignee
CONWAY ADRIAN E
US·11 granted patents·1 pending application·76 citations·filing 2005–2017
Top patents by PatentIndex Score
12 records- 0195US8538694B2Real-time route and recharge planningCONWAY ADRIAN E·Filed 2010·Granted Sep 17, 2013·34 cites·28 claims
- 0288US8099272B2Multi-layered model for survivability analysis of network servicesCONWAY ADRIAN E·Filed 2007·Granted Jan 17, 2012·18 cites·20 claims
- 0379US9331888B1Methods and systems for bridging communications between an IP network and a voice communication service at a subscriber premisesCONWAY ADRIAN E·Filed 2005·Granted May 3, 2016·9 cites·31 claims
- 0472US8650035B1Speech conversionCONWAY ADRIAN E·Filed 2005·Granted Feb 11, 2014·7 cites·17 claims
- 0570US8886506B2Path failure importance samplingCONWAY ADRIAN E·Filed 2011·Granted Nov 11, 2014·3 cites·24 claims
- 0669US8271647B2Method and system for energy efficient routing and network servicesCONWAY ADRIAN E·Filed 2011·Granted Sep 18, 2012·2 cites·22 claims
- 0762US8935142B2Simulation of communication networksCONWAY ADRIAN E·Filed 2009·Granted Jan 13, 2015·2 cites·25 claims
- 0860US8224868B2Network coding with last modified dates for P2P web cachingCONWAY ADRIAN E·Filed 2008·Granted Jul 17, 2012·1 cites·10 claims
- 0948US8645482B2Network coding with last modified dates for P2P web cachingCONWAY ADRIAN E·Filed 2011·Granted Feb 4, 2014·0 cites·20 claims
- 1045US8842544B2Trap-free shortest link-and-shared risk link group-disjoint pathsCONWAY ADRIAN E·Filed 2011·Granted Sep 23, 2014·0 cites·20 claims
- 1145US8842543B2Trap-free shortest link-disjoint pathsCONWAY ADRIAN E·Filed 2011·Granted Sep 23, 2014·0 cites·22 claims
- 1239US2017277522A1Providing a network simulation code generation service by a cloud-based infrastructureCONWAY ADRIAN E·Filed 2017·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when CONWAY ADRIAN E files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Counts cover granted patents and pending applications in the PatentIndex corpus. How scoring works →