IP Library Granted Patent US 12,681,830
Granted Patent B2
US 12,681,830 · App. 18/812,913 · Granted Jul 14, 2026

Dynamic system resource-sensitive model software and hardware selection

Inventors: Sourabh Deb (Tampa, FL); Jason Engelbrecht (London, GB); Zheyu Wang (Shanghai, CN); Haolin Jin (Shanghai, CN); Payal Jain (London, GB); Tariq Husayn Maonah (London, GB); Mariusz Saternus (Cracow, PL); Daniel Lewandowski (Cracow, PL); Biraj Krushna Rath (London, GB); Stuart Murray (London, GB); Philip Davies (London, GB)
G06F11/3419G06F9/5055
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,681,830
App. No.
18/812,913
Granted
Jul 14, 2026
Kind
B2
Abstract

The systems and methods disclosed herein enable the dynamic selection of one or more AI models to generate an output in response to an input. The system receives, from a computing device, an output generation request including an input for the generation of an output using one or more models from a plurality of models. The system generates expected values for a set of output attributes of the output generation request. For each particular model in the plurality of models, the system determines the capabilities of the particular model, and dynamically select a subset of models from the plurality of models. The system dynamically selects a subset of available system resources to process the input included in the output generation request. The system generates the output by processing the input included in the output generation request using the selected subset of available system resources.

Claims (79)

1 . A non-transitory computer-readable storage medium comprising instructions stored thereon, wherein the instructions when executed by at least one data processor of a system, cause the system to:

receive, from a computing device, a set of output generation requests, each comprising a prompt for generation of one or more responses by executing one or more artificial intelligence (AI) models on one or more hardware resources of a set of available hardware resources;

for each output generation request of the set of output generation requests: using the prompt of the output generation request, generate a set of output attributes of the output generation request, wherein the generated set of output attributes of the output generation request indicate: (1) a type of the output generated from the prompt and (2) a threshold response time of the generation of the output; using the set of output attributes, map the output generation request to a set of requested hardware resources by: identifying one or more dependencies associated with processing the output generation request using the one or more AI models, and using the identified dependencies, determining an estimated hardware resource usage associated with processing the output generation request using the one or more AI models;

dynamically partition the set of available hardware resources to determine, for the each output generation request, a set of selected hardware resources within the set of available hardware resources using: (1) a compatibility between one or more hardware resources of the set of available hardware resources and the set of requested hardware resources and (2) one or more sets of requested hardware resources of other output generation requests in the set of output generation requests;

provide the prompt of each output generation request to a corresponding set of selected hardware resources to generate a set of outputs by processing the prompt included in the output generation request using the one or more AI models; and

responsive to the generated set of outputs, transmit, to the computing device, the output within the threshold response time.

2 . The non-transitory computer-readable storage medium of claim 1 , wherein the instructions further cause the system to:

obtain a set of operation boundaries of the one or more AI models; and

map the output generation request to the set of requested hardware resources in accordance with the set of operation boundaries.

3 . The non-transitory computer-readable storage medium of claim 1 ,

wherein each output generation request includes a predefined query context corresponding to a user of the computing device, and

wherein the predefined query context includes a vector representation of one or more output attributes.

4 . The non-transitory computer-readable storage medium of claim 1 , wherein the instructions further cause the system to:

generate for display at the computing device, a layout indicating the set of outputs, wherein the layout includes one or more of:

a first representation of each AI model,

a second representation of the corresponding set of selected hardware resources, or

a third representation of the set of outputs.

5 . The non-transitory computer-readable storage medium of claim 1 , wherein the set of available hardware resources includes (1) a set of shared hardware and (2) a set of dedicated hardware, wherein generating the set of output further causes the system to:

using the set of shared hardware, process the prompt included in the output generation request using the one or more AI models for a predetermined time period; and

upon expiration of the predetermined time period, continue processing the prompt using the one or more AI models on the set of dedicated hardware.

6 . The non-transitory computer-readable storage medium of claim 1 , wherein the instructions further cause the system to:

receive a set of user feedback associated with the generated set of outputs, wherein the set of user feedback indicates an expected set of outputs; and

using the received user feedback, adjust the dynamic partitioning of the set of available hardware resources to satisfy the expected set of outputs.

7 . The non-transitory computer-readable storage medium of claim 1 , wherein determining the estimated hardware resource usage indicates usage of one or more of:

central processing unit (CPU) resources,

graphical processing unit (GPU) resources, or

memory resources.

8 . A method for dynamically selecting hardware resources based on resource usage, the method comprising:

obtaining, from a computing device, a set of output generation requests, each comprising an input for generation of one or more results by executing one or more artificial intelligence (AI) models on one or more hardware resources of a set of available hardware resources;

for each output generation request of the set of output generation requests, associating the output generation request to a set of requested hardware resources by determining an estimated hardware resource usage associated with processing the output generation request using the one or more AI models;

dynamically partitioning the set of available hardware resources to determine, for the each output generation request, a set of selected hardware resources within the set of available hardware resources using one or more of: (1) a compatibility between one or more hardware resources of the set of available hardware resources and the set of requested hardware resources, or (2) one or more sets of requested hardware resources of other output generation requests in the set of output generation requests; and

providing the input of each output generation request to a corresponding set of selected hardware resources to generate a set of outputs by processing the input included in the output generation request using the one or more AI models.

9 . The method of claim 8 , further comprising:

for each output generation request, assigning a set of weights to each hardware resource of the set of available hardware resources.

10 . The method of claim 8 ,

wherein the one or more AI models is a first set of AI models,

wherein dynamically partitioning the set of available hardware resources uses a second set of AI models, and

wherein the first set of AI models is different from the second set of AI models.

11 . The method of claim 8 , further comprising, for one or more hardware resources of the set of available hardware resources:

determining a current resource usage value for the available hardware resource;

determining a maximum usage value for the available hardware resource; and

calculating an allowance value corresponding to the available hardware resource for the set of output generation requests using a difference between a corresponding maximum usage value and a corresponding current resource usage value.

12 . The method of claim 8 , further comprising:

partitioning one or more output generation requests of the set of output generation requests into a set of segments; and

routing each segment of the set of segments to the set of selected hardware resources,

wherein at least one segment is routed to a different selected hardware resource than another segment in the set of segments.

13 . The method of claim 8 , further comprising:

generating for display at the computing device, a layout indicating the set of outputs, wherein the layout includes one or more of:

a first representation of each AI model,

a second representation of the corresponding set of selected hardware resources, or

a third representation of the set of outputs.

14 . The method of claim 8 , further comprising:

receiving a set of user feedback on the generated set of outputs; and

using the received user feedback, adjusting the dynamic partitioning of the set of available hardware resources.

15 . A system comprising: at least one hardware processor; and at least one non-transitory memory storing instructions, which, when executed by the at least one hardware processor, cause the system to:

obtain, from a computing device, a set of output generation requests, each comprising an input for generation of one or more results by executing one or more software applications on one or more hardware resources of a set of available hardware resources;

for one or more output generation requests of the set of output generation requests, associating the output generation request to a set of requested hardware resources using an estimated hardware resource usage associated with processing the output generation request by the one or more software applications;

dynamically partition the set of available hardware resources to determine, for the each output generation request of the one or more output generation requests, a set of selected hardware resources within the set of available hardware resources using one or more of: (1) a compatibility between one or more hardware resources of the set of available hardware resources and the set of requested hardware resources, or (2) one or more sets of requested hardware resources of other output generation requests in the set of output generation requests; and

provide the input of the one or more output generation requests to a corresponding set of selected hardware resources to generate a set of outputs by processing the input included in the output generation request using the one or more software applications.

16 . The system of claim 15 , wherein the system is further caused to:

wherein the one or more software applications is a first set of software applications,

wherein dynamically partitioning the set of available hardware resources uses a second set of software applications, and

wherein the first set of software applications is different from the second set of software applications.

17 . The system of claim 15 , wherein the system is further caused to, for one or more hardware resources of the set of available hardware resources:

determine a current resource usage value for the available hardware resource;

determine a maximum usage value for the available hardware resource; and

calculate an allowance value corresponding to the available hardware resource for the set of output generation requests using a difference between a corresponding maximum usage value and a corresponding current resource usage value.

18 . The system of claim 15 , wherein the system is further caused to:

partition one or more output generation requests of the set of output generation requests into a set of segments; and

route each segment of the set of segments to the set of selected hardware resources,

wherein at least one segment is routed to a different selected hardware resource than another segment in the set of segments.

19 . The system of claim 15 , wherein the system is further caused to:

generate for display at the computing device, a layout indicating the set of outputs, wherein the layout includes one or more of:

a first representation of each software application,

a second representation of the corresponding set of selected hardware resources, or

a third representation of the set of outputs.

20 . The system of claim 15 , wherein the system is further caused to:

receive a set of user feedback on the generated set of outputs; and

using the received user feedback, adjust the dynamic partitioning of the set of available hardware resources.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 10, 2026
From: JAIN, PAYAL; MAONAH, TARIQ HUSAYN; SATERNUS, MARIUSZ; LEWANDOWSKI, DANIEL; RATH, BIRAJ KRUSHNA; MURRAY, STUART; DAVIES, PHILIP
To: CITIBANK, N.A.
Reel/Frame 074911/0095 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 9, 2024
From: DEB, SOURABH; ENGELBRECHT, JASON; WANG, ZHEYU; JIN, HAOLIN
To: CITIBANK, N.A.
Reel/Frame 068531/0636 →
Continuity (4)
Continuation In Part 18661532 · May 10, 2024
Continuation In Part 18661519 · May 10, 2024
Continuation In Part 18633293 · Apr 11, 2024
Related Publication 20250321850A1 · Oct 16, 2025
References Cited (305)
US 5423041A · Burke et al. · 1995 [cited by applicant]
US 5586218A · Allen · 1996 [cited by applicant]
US 5671361A · Brown et al. · 1997 [cited by applicant]
US 6169981B1 · Werbos · 2001 [cited by applicant]
US 6208720B1 · Curtis et al. · 2001 [cited by applicant]
US 6473748B1 · Archer · 2002 [cited by applicant]
US 6546545B1 · Honarvar et al. · 2003 [cited by applicant]
US 6587846B1 · Lamuth · 2003 [cited by applicant]
US 7313552B2 · Lorenz et al. · 2007 [cited by applicant]
US 7669133B2 · Chikirivao et al. · 2010 [cited by applicant]
US 7822621B1 · Chappel · 2010 [cited by applicant]
US 7984513B1 · Kyne et al. · 2011 [cited by applicant]
US 8380817B2 · Okada · 2013 [cited by applicant]
US 8387020B1 · Maclachlan et al. · 2013 [cited by applicant]
US 8572552B2 · Kennaley · 2013 [cited by applicant]
US 8656343B2 · Fox et al. · 2014 [cited by applicant]
US 8930298B2 · Demuth et al. · 2015 [cited by applicant]
US 9020872B2 · Junker · 2015 [cited by applicant]
US 9215212B2 · Reddy et al. · 2015 [cited by applicant]
US 9251466B2 · Rajesh · 2016 [cited by applicant]
US 9842045B2 · Heorhiadi et al. · 2017 [cited by applicant]
US 9858828B1 · Fuka · 2018 [cited by applicant]
US 10157355B2 · Johnson et al. · 2018 [cited by applicant]
US 10276170B2 · Gruber et al. · 2019 [cited by applicant]
US 10438212B1 · Jilani et al. · 2019 [cited by applicant]
US 10554738B1 · Ren · 2020 [cited by examiner]
US 10607141B2 · Jerram et al. · 2020 [cited by applicant]
US 10620988B2 · Lauderdale et al. · 2020 [cited by applicant]
US 10755103B2 · Chang et al. · 2020 [cited by applicant]
US 10764150B1 · Hermoni et al. · 2020 [cited by applicant]
US 10943067B1 · Brown et al. · 2021 [cited by applicant]
US 10949337B1 · Yalla et al. · 2021 [cited by applicant]
US 10951485B1 · Hermoni et al. · 2021 [cited by applicant]
US 11042647B1 · Joyce et al. · 2021 [cited by applicant]
US 11074107B1 · Nandakumar · 2021 [cited by applicant]
US 11106801B1 · Levine et al. · 2021 [cited by applicant]
US 11133942B1 · Griffin · 2021 [cited by applicant]
US 11153177B1 · Hermoni et al. · 2021 [cited by applicant]
US 11164078B2 · Jin et al. · 2021 [cited by applicant]
US 11227047B1 · Vashisht et al. · 2022 [cited by applicant]
US 11227187B1 · Weinberger · 2022 [cited by applicant]
US 11271822B1 · Hermoni et al. · 2022 [cited by applicant]
US 11315196B1 · Narayan et al. · 2022 [cited by applicant]
US 11328068B1 · Niedzwiedz et al. · 2022 [cited by applicant]
US 11410136B2 · Cook et al. · 2022 [cited by applicant]
US 11436777B1 · Karli et al. · 2022 [cited by applicant]
US 11470106B1 · Lin et al. · 2022 [cited by applicant]
US 11481553B1 · Durvasula et al. · 2022 [cited by applicant]
US 11503075B1 · Sirianni et al. · 2022 [cited by applicant]
US 11516158B1 · Luzhnica et al. · 2022 [cited by applicant]
US 11516222B1 · Srinivasan et al. · 2022 [cited by applicant]
US 11531943B1 · Kumar · 2022 [cited by applicant]
US 11562078B2 · Sabourin et al. · 2023 [cited by applicant]
US 11573848B2 · Linck et al. · 2023 [cited by applicant]
US 11586436B1 · Jennings · 2023 [cited by applicant]
US 11593390B2 · Sundel · 2023 [cited by applicant]
US 11652839B1 · Aloisio et al. · 2023 [cited by applicant]
US 11656852B2 · Mazurskiy · 2023 [cited by applicant]
US 11663409B2 · Terry et al. · 2023 [cited by applicant]
US 11663662B2 · Chen et al. · 2023 [cited by applicant]
US 11676685B2 · Jaganathan et al. · 2023 [cited by applicant]
US 11681610B2 · Chang et al. · 2023 [cited by applicant]
US 11681811B1 · Dixit · 2023 [cited by applicant]
US 11683333B1 · Dominessy et al. · 2023 [cited by applicant]
US 11706241B1 · Cross et al. · 2023 [cited by applicant]
US 11709757B1 · Kurian et al. · 2023 [cited by applicant]
US 11720686B1 · Cross et al. · 2023 [cited by applicant]
US 11734418B1 · Epstein · 2023 [cited by applicant]
US 11734591B2 · Turner et al. · 2023 [cited by applicant]
US 11741226B2 · Dixit · 2023 [cited by applicant]
US 11750530B2 · Agardh · 2023 [cited by examiner]
US 11750717B2 · Walsh et al. · 2023 [cited by applicant]
US 11765100B1 · Sloane · 2023 [cited by examiner]
US 11803792B2 · Makhija et al. · 2023 [cited by applicant]
US 11811730B1 · Kandasamy et al. · 2023 [cited by applicant]
US 11823108B1 · Bradbury et al. · 2023 [cited by applicant]
US 11842408B1 · Martinez et al. · 2023 [cited by applicant]
US 11853735B1 · Choudhury et al. · 2023 [cited by applicant]
US 11874934B1 · Rao et al. · 2024 [cited by applicant]
US 11875123B1 · Ben David et al. · 2024 [cited by applicant]
US 11875130B1 · Bosnjakovic et al. · 2024 [cited by applicant]
US 11915152B2 · Baker · 2024 [cited by applicant]
US 11924027B1 · Mysore et al. · 2024 [cited by applicant]
US 11947435B2 · Boulineau et al. · 2024 [cited by applicant]
US 11960515B1 · Pallakonda et al. · 2024 [cited by applicant]
US 11983806B1 · Ramesh et al. · 2024 [cited by applicant]
US 11990139B1 · Sandrew · 2024 [cited by applicant]
US 11995412B1 · Mishra · 2024 [cited by applicant]
US 12001463B1 · Pallakonda et al. · 2024 [cited by applicant]
US 12007963B1 · Rajagopalan et al. · 2024 [cited by applicant]
US 12026599B1 · Lewis et al. · 2024 [cited by applicant]
US 12028368B1 · Cohen et al. · 2024 [cited by applicant]
US 12088611B1 · Lin et al. · 2024 [cited by applicant]
US 12094010B1 · Hampapur et al. · 2024 [cited by applicant]
US 12106205B1 · Jain et al. · 2024 [cited by applicant]
US 12111747B1 · Jain et al. · 2024 [cited by applicant]
US 12131819B1 · Murray et al. · 2024 [cited by applicant]
US 12135949B1 · Cameron et al. · 2024 [cited by applicant]
US 12147513B1 · Jain et al. · 2024 [cited by applicant]
US 12149553B1 · Fly et al. · 2024 [cited by applicant]
US 12149558B1 · Brown et al. · 2024 [cited by applicant]
US 12155781B1 · Helfgott et al. · 2024 [cited by applicant]
US 12182258B2 · Stokes et al. · 2024 [cited by applicant]
US 20030007178A1 · Jeyachandran et al. · 2003 [cited by applicant]
US 20040098454A1 · Trapp et al. · 2004 [cited by applicant]
US 20050204348A1 · Horning et al. · 2005 [cited by applicant]
US 20060095918A1 · Hirose · 2006 [cited by applicant]
US 20070067848A1 · Gustave et al. · 2007 [cited by applicant]
US 20100275263A1 · Bennett et al. · 2010 [cited by applicant]
US 20100313189A1 · Beretta et al. · 2010 [cited by applicant]
US 20140137257A1 · Martinez et al. · 2014 [cited by applicant]
US 20140258998A1 · Adl-tabatabai et al. · 2014 [cited by applicant]
US 20170061132A1 · Hovor et al. · 2017 [cited by applicant]
US 20170262164A1 · Jain et al. · 2017 [cited by applicant]
US 20170279826A1 · Mohanty et al. · 2017 [cited by applicant]
US 20170295197A1 · Parimi et al. · 2017 [cited by applicant]
US 20180020021A1 · Gilmore et al. · 2018 [cited by applicant]
US 20180239903A1 · Bodin et al. · 2018 [cited by applicant]
US 20180343114A1 · Ben-ari · 2018 [cited by applicant]
US 20190188706A1 · Mccurtis · 2019 [cited by applicant]
US 20190236661A1 · Hogg et al. · 2019 [cited by applicant]
US 20190286816A1 · Fu · 2019 [cited by applicant]
US 20200012493A1 · Sagy · 2020 [cited by applicant]
US 20200043164A1 · Fuchs et al. · 2020 [cited by applicant]
US 20200074470A1 · Deshpande et al. · 2020 [cited by applicant]
US 20200133711A1 · Webster et al. · 2020 [cited by applicant]
US 20200153855A1 · Kirti et al. · 2020 [cited by applicant]
US 20200219009A1 · Dao et al. · 2020 [cited by applicant]
US 20200233979A1 · Tahmasebi Maraghoosh et al. · 2020 [cited by applicant]
US 20200259852A1 · Wolff et al. · 2020 [cited by applicant]
US 20200309767A1 · Loo et al. · 2020 [cited by applicant]
US 20200314191A1 · Madhavan et al. · 2020 [cited by applicant]
US 20200334083A1 · Liu · 2020 [cited by examiner]
US 20200334326A1 · Zhang et al. · 2020 [cited by applicant]
US 20200349054A1 · Dai et al. · 2020 [cited by applicant]
US 20200380118A1 · Miller et al. · 2020 [cited by applicant]
US 20200387608A1 · Miller et al. · 2020 [cited by applicant]
US 20210012486A1 · Huang et al. · 2021 [cited by applicant]
US 20210049288A1 · Li · 2021 [cited by applicant]
US 20210089941A1 · Chen et al. · 2021 [cited by applicant]
US 20210133182A1 · Anderson et al. · 2021 [cited by applicant]
US 20210173935A1 · Ramasamy et al. · 2021 [cited by applicant]
US 20210185094A1 · Waplington et al. · 2021 [cited by applicant]
US 20210211431A1 · Albero et al. · 2021 [cited by applicant]
US 20210256125A1 · Miller et al. · 2021 [cited by applicant]
US 20210264547A1 · Li · 2021 [cited by applicant]
US 20210273957A1 · Boyer et al. · 2021 [cited by applicant]
US 20210390465A1 · Werder et al. · 2021 [cited by applicant]
US 20220050928A1 · Shukla et al. · 2022 [cited by applicant]
US 20220114251A1 · Guim Bernat et al. · 2022 [cited by applicant]
US 20220114399A1 · Castiglione et al. · 2022 [cited by applicant]
US 20220147636A1 · Mahuli et al. · 2022 [cited by applicant]
US 20220179906A1 · Desai et al. · 2022 [cited by applicant]
US 20220198304A1 · Szczepanik et al. · 2022 [cited by applicant]
US 20220263843A1 · Aslam et al. · 2022 [cited by applicant]
US 20220263855A1 · Engelberg et al. · 2022 [cited by applicant]
US 20220263860A1 · Crabtree et al. · 2022 [cited by applicant]
US 20220278889A1 · Malleshaiah et al. · 2022 [cited by applicant]
US 20220286438A1 · Burke et al. · 2022 [cited by applicant]
US 20220286474A1 · Kuppa et al. · 2022 [cited by applicant]
US 20220294789A1 · Tikhomirov et al. · 2022 [cited by applicant]
US 20220294810A1 · Tyagi et al. · 2022 [cited by applicant]
US 20220303300A1 · Egan · 2022 [cited by applicant]
US 20220303302A1 · Hwang et al. · 2022 [cited by applicant]
US 20220303352A1 · Herzog et al. · 2022 [cited by applicant]
US 20220311681A1 · Palladino et al. · 2022 [cited by applicant]
US 20220318654A1 · Lin et al. · 2022 [cited by applicant]
US 20220327620A1 · Ndoutoumou · 2022 [cited by applicant]
US 20220334818A1 · Mcfarland · 2022 [cited by applicant]
US 20220342846A1 · Kunchakarra et al. · 2022 [cited by applicant]
US 20220345457A1 · Jeffords et al. · 2022 [cited by applicant]
US 20220358023A1 · Moser et al. · 2022 [cited by applicant]
US 20220366140A1 · Saito et al. · 2022 [cited by applicant]
US 20220368728A1 · Murray et al. · 2022 [cited by applicant]
US 20220377093A1 · Crabtree et al. · 2022 [cited by applicant]
US 20220398149A1 · Mcfarland et al. · 2022 [cited by applicant]
US 20220400135A1 · Gamra · 2022 [cited by applicant]
US 20220414213A1 · Dixit · 2022 [cited by applicant]
US 20220414536A1 · M L et al. · 2022 [cited by applicant]
US 20220417274A1 · Madanahalli et al. · 2022 [cited by applicant]
US 20230007039A1 · Waplington · 2023 [cited by applicant]
US 20230009999A1 · Higuchi et al. · 2023 [cited by applicant]
US 20230019072A1 · Okunlola · 2023 [cited by applicant]
US 20230032686A1 · Williams et al. · 2023 [cited by applicant]
US 20230033317A1 · Lin et al. · 2023 [cited by applicant]
US 20230035321A1 · Vijayaraghavan · 2023 [cited by applicant]
US 20230039855A1 · Greene · 2023 [cited by applicant]
US 20230044102A1 · Anderson et al. · 2023 [cited by applicant]
US 20230052608A1 · Wattiau et al. · 2023 [cited by applicant]
US 20230067128A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230071264A1 · Hakala et al. · 2023 [cited by applicant]
US 20230076372A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230077527A1 · Sarkar · 2023 [cited by applicant]
US 20230109021A1 · Curtin et al. · 2023 [cited by applicant]
US 20230113621A1 · Griffin et al. · 2023 [cited by applicant]
US 20230114719A1 · Thomas et al. · 2023 [cited by applicant]
US 20230117962A1 · Kaimal et al. · 2023 [cited by applicant]
US 20230118388A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230123314A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230132703A1 · Marsenic et al. · 2023 [cited by applicant]
US 20230135660A1 · Chapman et al. · 2023 [cited by applicant]
US 20230148116A1 · Stokes et al. · 2023 [cited by applicant]
US 20230164158A1 · Fellows et al. · 2023 [cited by applicant]
US 20230169397A1 · Smith et al. · 2023 [cited by applicant]
US 20230171282A1 · Bollinger · 2023 [cited by applicant]
US 20230177441A1 · Durvasula et al. · 2023 [cited by applicant]
US 20230177613A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230186175A1 · Usatov · 2023 [cited by examiner]
US 20230205888A1 · Tyagi et al. · 2023 [cited by applicant]
US 20230205891A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230208869A1 · Bisht et al. · 2023 [cited by applicant]
US 20230208870A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230208871A1 · Yellapragada et al. · 2023 [cited by applicant]
US 20230229542A1 · Watkins et al. · 2023 [cited by applicant]
US 20230252393A1 · Orzechowski et al. · 2023 [cited by applicant]
US 20230259860A1 · Sarkar · 2023 [cited by applicant]
US 20230269272A1 · Dambrot et al. · 2023 [cited by applicant]
US 20230274003A1 · Liu et al. · 2023 [cited by applicant]
US 20230359789A1 · Andre et al. · 2023 [cited by applicant]
US 20230362200A1 · Crabtree et al. · 2023 [cited by applicant]
US 20230396641A1 · Hebbagodi et al. · 2023 [cited by applicant]
US 20230412635A1 · Binyamini et al. · 2023 [cited by applicant]
US 20240012734A1 · Lee et al. · 2024 [cited by applicant]
US 20240020538A1 · Socher et al. · 2024 [cited by applicant]
US 20240054233A1 · Ohayon et al. · 2024 [cited by applicant]
US 20240054249A1 · Loubet Moundi et al. · 2024 [cited by applicant]
US 20240095077A1 · Singh et al. · 2024 [cited by applicant]
US 20240129345A1 · Kassam et al. · 2024 [cited by applicant]
US 20240202442A1 · Saito et al. · 2024 [cited by applicant]
US 20240256678A1 · Thompson · 2024 [cited by applicant]
US 20240364749A1 · Crabtree et al. · 2024 [cited by applicant]
US 20240403428A1 · Lal et al. · 2024 [cited by applicant]
US 20240403437A1 · Szigeti et al. · 2024 [cited by applicant]
US 20240403445A1 · Straub et al. · 2024 [cited by applicant]
US 20240406145A1 · Crabtree et al. · 2024 [cited by applicant]
US 20240411896A1 · Myers et al. · 2024 [cited by applicant]
US 20240414211A1 · Boyer et al. · 2024 [cited by applicant]
CN 106502890A · 2017 [cited by applicant]
WO 2021160499A1 · 2021 [cited by applicant]
WO 2022125803A1 · 2022 [cited by applicant]
WO 2024020416A1 · 2024 [cited by applicant]
“Veerendra Battula, Dynamic Resource Allocation in Solaris/Linux Hybrid Environments Using Real-Time Monitoring And AI-Biased Load Balancing 2021, National Institute of Health, vol. 5, pp. 81-89” (Year: 2021). [cited by examiner]
“Constantin Viorel Marian, Artificial Intelligence-Based Algorithm For Resource Allocation, 2022, IEEE, 8 pages” (Year: 2022). [cited by examiner]
“David Vengerov, A Reinforcement Learning Approach to Dynamic Resource Allocation, 2007, Science Direct, vol. 20, Issue 3, 13 Pages” (Year: 2007). [cited by examiner]
Generative machine learning models; IPCCOM000272835D, Aug. 17, 2023. (Year: 2023). [cited by applicant]
AI Risk Management Framework NIST, retrieved on Jun. 17, 2024, https://www.nist.gov/itl/ai-risk-management-framework. [cited by applicant]
Empower Your Team with a Compliance Co-Pilot, Sedric, retrieved on Sep. 25, 2024. https://www.sedric.ai/. [cited by applicant]
Independent analysis of AI language models and API providers. Artificial Analysis, retrieved on Jun. 13, 2024, https://artificialanalysis.ai/, 11 pages. [cited by applicant]
What is AI Verify?, AI Verify Foundation, Jun. 11, 2024, 3 pages, https://aiverifyfoundation.sg/. [cited by applicant]
Behravesh et al, “Rule Modeling Engine for Optimizing Complex Event Processing Patterns”, IEEE, pp. 128-135 (Year: 2009). [cited by applicant]
Brown, D., et al., “The Great AI Challenge: We Test Five Top Bots on Useful, Everyday Skills,” The Wall Street Journal, published May 25, 2024. [cited by applicant]
Burnashev et al, “Design and Implementation of Integrated Development Environment for Building Rule-Based Expert Systems”, IEEE, pp. 1-4 (Year: 2020). [cited by applicant]
Cranium, Adopt & Accelerate AI Safely, retrieved on Nov. 7, 2024, from https://cranium.ai/. [cited by applicant]
Cuadrado et al, “An Autonomous Engine for Services Configuration and Deployment”, IEEE, pp. 520-536 (Year: 2012). [cited by applicant]
Dong, Y., et al., “Building Guardrails for Large Language Models,” https://ar5iv.labs.arxiv.org/html/2402.01822v1, published May 29, 2024, 20 pages. [cited by applicant]
Fickas, “Design Issues in a Rule-Based System”, ACM, pp. 208-215 (Year: 1985). [cited by applicant]
Futurism, “Sam Altman Admits That OpenAI Doesn't Actually Understand How Its AI Works”, Jun. 11, 2024, 4 pages, https://futurism.com/sam-altman-admits-openai-understand-ai. [cited by applicant]
Ge et al, “Automatic Generation of Rule-based Software Configuration Management Systems”, ACM, pp. 659 (Year: 2005). [cited by applicant]
Geiger, et al., “TadGAN: Time series anomaly detection using generative adversarial networks”, 2020 IEEE International Conference on Big Data, 2020 (Year: 2020). [cited by applicant]
Genesis et al “CI Ref: A Tool for Visualizing the Historical Data of Software Refactorings in Java Projects”, ACM, pp. 174-179 (Year: 2023). [cited by applicant]
Guana et al., “Backward Propagation of Code Refinements on Transformational Code Generation Environments”, IEEE, pp. 55-60 (Year: 2013). [cited by applicant]
Guldimann, P., et al. “COMPL-AI Framework: A Technical Interpretation and LLM Benchmarking Suite for the EU Artificial Intelligence Act,” arXiv:2410.07959v1 [cs.CL] Oct. 10, 2024, 38 pages. [cited by applicant]
Halvonik et al, “Large Language Models and Rule-Based Approaches in Domain-Specific Communication”, IEEE, pp. 107046-107058 (Year: 2024). [cited by applicant]
Hu, Q., J., et al., “Routerbench: A Benchmark for Multi-LLM Routing System,” arXiv:2403.12031v2 [cs.LG] Mar. 28, 2024, 16 pages. [cited by applicant]
Huang et al, “AI Coding: Learning to Construct Error Correction Codes”, IEEE, pp. 26-39 (Year: 2020). [cited by applicant]
International Search Report and Written Opinion received in Application No. PCT/US24/47571, dated Dec. 9, 2024, 10 pages. [cited by applicant]
International Search Report and Written Opinion received in Application No. PCT/US25/24406, dated Jul. 18, 2025, 10 pages. [cited by applicant]
International Search Report and Written Opinion Received received in Application No. PCT/US23/85942, dated Feb. 15, 2024, 6 pages. [cited by applicant]
Jiang et al, “Self-Planning Code Generation with Large Language Models”, ACM, pp. 1-30 (Year: 2024). [cited by applicant]
Kibria et al, “Big Data Analytics, Machine Learning, andArtificial Intelligence in Next-Generation Wireless Networks”, IEEE, pp. 32328-32338 (Year: 2018). [cited by applicant]
Kojima, Takeshi, et al. “Large Language Models are Zero-Shot Reasoners,” 36th Conference on Neural Information Processing Systems (NeurIPS 2022), arXiv:2205.11916 [cs.CL], Jan. 29, 2023, 42 pages. [cited by applicant]
Kumar et al, “A Rule-based Recommendation System for Selection of Software Development Life Cycle Models”, ACM, pp. 1-6 ( Year: 2013). [cited by applicant]
Langley et al, “Applications of Machine Learning and Rule Induction”, ACM, pp. 54-64 (Year: 1995). [cited by applicant]
Idrizi “Exploring the Role of Explainable Artificial Intelligence(XAI) in Adaptive learning systems”, ACM, pp. 100-105 (Year: 2024). [cited by applicant]
Li, et al., “Anomaly detection with generative adversarial networks for multivariate time series” arXiv: 1809.04758V3 [cs.LG] Jan. 15, 2019. [cited by applicant]
Mathews, A. W., “What AI Can Do in Healthcare—and What It Should Never Do,” The Wall Street Journal, published on Aug. 21, 2024, retrieved on Sep. 5, 2024 https://www.wsj.com. [cited by applicant]
Mavrepis, P., et al., “XAI for All: Can Large Language Models Simplify Explainable AI?,” https://arxiv.org/abs/2401.13110, Jan. 23, 2024, 10 pages. [cited by applicant]
Mezini, Programming and Execution Models for Next Generation Code Intelligence Systems (Keynote), ACM, pp. 1-2 (Year: 2021). [cited by applicant]
Mollick, E., “Latent Expertise: Everyone is in R&D,” One Useful Thing, published on Jun. 20, 2024, https://www.oneusefulthing.org/p/latent-expertise-everyone-is-in-r. [cited by applicant]
Nauta, M., et al., “From Anecdotal Evidence to Quantative Evaluation Methods: A Systematic Review of Evaluating Explainable AI” ACM Computing Surveys, vol. 55 No. 13s Article 295, 2023 [retrieved Jul. 3, 2024]. [cited by applicant]
Peers, M., “What California AI Bill Could Mean,” The Briefing, published and retrieved Aug. 30, 2024, 8 pages, https://www.theinformation.com/articles/what-california-ai-bill-could-mean. [cited by applicant]
Rattanasawad et al, “A Review and Comparison of Rule Languages and Rule-based Inference Engines for the Semantic Web”, IEEE, pp. 1-6 (Year: 2013). [cited by applicant]
Schlegl, et al., “f-AnoGAN: Fast unsupervised anomaly detection with generative adversarial networks”, Medical Image Analysis 54 (2019) 30-44, 2019. [cited by applicant]
Soares et al, “Explaining Deep Learning Models Through Rule-Based Approximation and Visualization”, IEEE, pp. 2399-2407 (Year: 2021). [cited by applicant]
Sottara et al., “Enhancing A Production Rule Engine with Predictive Models Using PMML”, ACM, pp. 39-47 (Year: 2011). [cited by applicant]
Sumuk Shashidhar et al., ‘Democratizing LLMs: An Exploration of Cost-Performance Trade-offs in Self-Refined Open-Source Models’, arXiv:2310.07611v2, pp. 1-15, Oct. 2023. [cited by applicant]
Sun et al, “Efficient Rule Engine for Smart Building Systems”, IEEE, pp. 1658-1669 (Year: 2015). [cited by applicant]
Vartak et al “MODELDB: A System for Machine Learning Model Management”, ACM, pp. 1-3 (Year: 2016). [cited by applicant]
Vereschak et al, “Trust in AI-assisted Decision Making: Perspectives from Those Behind the System and Those for Whom the Decision is Made”, ACM, pp. 1-14 (Year: 2024). [cited by applicant]
Verma et al, “Integration of Rule based and Case based Reasoning System to Support Decision Making”, IEEE, pp. 106-108 (Year: 2014). [cited by applicant]
Wang et al, “Design and realization of distributed Rule Engine for scene linkage of Internet of Things”, IEEE, pp. 396-401 (Year: 2024). [cited by applicant]
Wei, Jason, et al. “Chain-of-Thought Prompting Elicits Reasoning in Large Language Models,” 36th Conference on Neural Information Processing Systems (NeurIPS 2022), arXiv:2201.11903 [cs.CL], Jan. 10, 2023, 43 pages. [cited by applicant]
Yang Liu et al., ‘Trustworthy LLMS: A Survey and Guideline for Evaluating Large Language Models' , Alignment’, arXiv:2308.05374v2, pp. 1-81, Mar. 2024. [cited by applicant]
Zhang et al, “Developing A Rule Engine for Automated Feature Recognition from CAD Models”, IEEE, pp. 3925-3930 (Year: 2009). [cited by applicant]
Zhao, H., et al., “Explainability for Large Language Models: A Survey,” https://arxiv.org/abs/2309.01029, Nov. 28, 2024, 38 pages. [cited by applicant]
Zhou, Y., Liu, Y., Li, X., Jin, J., Qian, H., Liu, Z., Li, C., Dou, Z., Ho, T., & Yu, P. S. (2024). Trustworthiness in Retrieval-Augmented Generation Systems: A Survey. ArXiv./abs/2409.10102. [cited by applicant]
“Singapore launches Project Moonshot”, a generative Artificial Intelligence testing toolkit to address LLM safety and security challenges, https://www.imda.gov.sg/resources/press-releases-factsheets-and-speeches/press-r… [cited by applicant]
Aggarwal, Nitin , KPIs for gen AI: Why measuring your new AI is essential to its success, https://cloud.google.com/transform/kpis-for-gen-ai-why-measuring-your-new-ai-is-essential-to-its-success. [cited by applicant]
Anthrop/C , Mapping the Mind of a Large Language Model, https://www.anthropic.com/research/mapping-mind-language-model, May 21, 2024. [cited by applicant]
Claburn, Thomas , OpenAI's GPT-4 can exploit real vulnerabilities by reading security advisories, The Register, https://www.theregister.com/2024/04/17/gpt4_can_exploit_real_vulnerabilities/?utm_source=tldrai, Apr. 17, 2… [cited by applicant]
Marshall, Andrew , Threat Modeling AI/ML Systems and Dependencies, Nov. 2, 2022, 27 pages. [cited by applicant]
Roose, Kevin , “A.I. Has a Measurement Problem”, The New York Times, Apr. 15, 2024, 5 pages. [cited by applicant]
Roose, Kevin , “A.I.'s Black Boxes Just Got a Little Less Mysterious”, The New York Times, May 21, 2024, 5 pages. [cited by applicant]
Shah, Harshay , Decomposing and Editing Predictions by Modeling Model Computation, arXiv:2404.11534v1 [cs.LG] Apr. 17, 2024. [cited by applicant]
Shankar, Ram , “Failure Modes in Machine Learning”, , Nov. 2019, 14 pages. [cited by applicant]