DR. MARTIN CARNELIUS TAYLOR, PHARM.D.
Pharmacy at Belvedere Ave, Baltimore, MD
License number
Maryland 17398
Category
Pharmacy
Type
Pharmacotherapy
Address
Address
2
2401 W Belvedere Ave, Baltimore, MD 21215
9650 Covered Wagon Dr APT B, Laurel, MD 20723
9650 Covered Wagon Dr APT B, Laurel, MD 20723
Phone
(410) 601-0562
(301) 725-2927
(301) 725-2927
Personal information
See more information about MARTIN CARNELIUS TAYLOR at radaris.comName
Address
Phone
4920 Lakeland Rd, College Park, MD 20740
3113 Plyers Mill Rd, Kensington, MD 20895
4009 Marjeff Pl APT C, Nottingham, MD 21236
4111 Stratton Rd, Temple Hills, MD 20748
8806 Joshua Ct, Pikesville, MD 21208
Professional information
Martin C Taylor, Baltimore MD - PHARMD
Specialties:
Pharmacotherapy
Address:
2401 W Belvedere Ave SUITE B, Baltimore 21215
(410) 601-0562 (Phone)
(410) 601-0562 (Phone)
Languages:
English
Hospitals:
2401 W Belvedere Ave SUITE B, Baltimore 21215
Sinai Hospital of Baltimore
2401 West Belvedere Ave, Baltimore 21215
Sinai Hospital of Baltimore
2401 West Belvedere Ave, Baltimore 21215
System And Method For Optimally Assigning Groups Of Individuals To Tasks
US Patent:
2007016, Jul 19, 2007
Filed:
Sep 13, 2006
Appl. No.:
11/520395
Inventors:
Christodoulos Floudas - Princeton NJ, US
Stacy Janak - Richmond TX, US
Martin Taylor - Baltimore MD, US
Maria Burka - Washington DC, US
T. J. Mountziaris - Williamsville NY, US
Stacy Janak - Richmond TX, US
Martin Taylor - Baltimore MD, US
Maria Burka - Washington DC, US
T. J. Mountziaris - Williamsville NY, US
International Classification:
G06N 3/12, G06N 3/02
US Classification:
706019000, 706013000
Abstract:
A system and method for optimally assigning groups of individuals to tasks, and in particular, a system and method for optimally assigning panels of reviewers to proposals, is disclosed. Information about an assignment problem to be solved acquired, such as the number of available reviewers in each panel, the number of proposals in each panel, reviewer preferences, and optional assignment rules. After data acquisition, a first modeling algorithm having at least one assignment constraint is applied to the acquired data a first modeled assignment scenario. A determination is made as to whether the modeled assignment scenario is feasible. If the modeled assignment is infeasible, a second modeling algorithm is applied to the acquired data to produce a second modeled assignment scenario, wherein one or more constraints to be violated (relaxed) to produce a more feasible outcome. After modeling, the results are displayed to the user and represent a suggested optimal assignment of individuals to tasks.