公开(公告)号：US11068304B2

公开(公告)日：2021-07-20

申请号：US16285170

申请日：2019-02-25

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Xinying Song ,  Ah Young Kim ,  Haiyuan Cao ,  Yu Wang ,  Hui Su ,  Shahina Ferdous ,  Jianfeng Gao ,  Karan Srivastava ,  Jaideep Sarkar

IPC: G06F9/48 ,  G06F9/46 ,  H04M3/52 ,  H04M3/51 ,  G06N20/00 ,  G06Q10/04 ,  G06Q10/06 ,  G06Q10/10 ,  G06F9/50 ,  G06K9/62 ,  H04M3/523 ,  G06N7/00 ,  G06N3/08 ,  G06N20/20

Abstract: Systems and methods are disclosed for intelligent scheduling of calls to sales leads, leveraging machine learning (ML) to optimize expected results. One exemplary method includes determining, using a connectivity prediction model, call connectivity rate predictions; determining timeslot resources; allocating, based at least on the call connectivity rate predictions and timeslot resources, leads to timeslots in a first time period; determining, within a timeslot and using a lead scoring model, lead prioritization among leads within the timeslot; configuring, based at least on the lead prioritization, the telephone unit with lead information for placing a phone call; and applying a contextual bandit (ML) process to update the connectivity prediction model, the lead scoring model, or both. During subsequent time periods, the updated connectivity prediction and lead scoring models are used, thereby improving expected results over time.

公开(公告)号：US10579430B2

公开(公告)日：2020-03-03

申请号：US15972968

申请日：2018-05-07

Applicant: Microsoft Technology Licensing, LLC

Inventor： Xinying Song ,  Jaideep Sarkar ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Hui Su ,  Jinchao Li ,  Andreea Bianca Spataru

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48

Abstract: Generally discussed herein are devices, systems, and methods for task routing. A method can include receiving, from a resource, a request for a task, in response to receiving the request, determining whether to retrieve a new task of new tasks stored in a first queue or a backlog task of backlog tasks stored in a second queue based on a combined amount of backlog tasks and new tasks relative to a capacity of the resource or the resources, retrieving the new task or the backlog task from the determined first queue or second queue, respectively, based on the determination, and providing the retrieved task to the resource.

公开(公告)号：US20190303197A1

公开(公告)日：2019-10-03

申请号：US15943206

申请日：2018-04-02

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Yu Wang ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Haiyuan Cao ,  Xinying Song ,  Hui Su ,  Jaideep Sarkar

IPC: G06F9/48 ,  G06F9/50 ,  G06K9/62 ,  G06F15/18

Abstract: Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

公开(公告)号：US10579423B2

公开(公告)日：2020-03-03

申请号：US15943206

申请日：2018-04-02

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Yu Wang ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Haiyuan Cao ,  Xinying Song ,  Hui Su ,  Jaideep Sarkar

IPC: G06F9/46 ,  G06F9/48 ,  G06K9/62 ,  G06F9/50 ,  G06N20/00

Abstract: Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

公开(公告)号：US10768908B1

公开(公告)日：2020-09-08

申请号：US16285180

申请日：2019-02-25

Applicant: Microsoft Technology Licensing, LLC

Inventor： Yu Wang ,  Yu Hu ,  Haiyuan Cao ,  Hui Su ,  Jinchao Li ,  Xinying Song ,  Jianfeng Gao

IPC: G06F8/35 ,  G06F16/901 ,  G06F8/70

Abstract: A workflow engine tool is disclosed that enables scientists and engineers to programmatically author workflows (e.g., a directed acyclic graph, “DAG”) with nearly no overhead, using a simpler script that needs almost no modifications for portability among multiple different workflow engines. This permits users to focus on the business logic of the project, avoiding the distracting tedious overhead related to workflow management (such as uploading modules, drawing edges, setting parameters, and other tasks). The workflow engine tool provides an abstraction layer on top of workflow engines, introducing a binding function that converts a programming language function (e.g., a normal python function) into a workflow module definition. The workflow engine tool infers module instances and induces edge dependencies automatically by inferring from a programming language script to build a DAG.

公开(公告)号：US11734066B2

公开(公告)日：2023-08-22

申请号：US16737474

申请日：2020-01-08

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Yu Wang ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Haiyuan Cao ,  Xinying Song ,  Hui Su ,  Jaideep Sarkar

IPC: G06F9/46 ,  G06F9/48 ,  G06F9/50 ,  G06N20/00 ,  G06F18/21

CPC classification number: G06F9/4887 ,  G06F9/4881 ,  G06F9/5005 ,  G06F18/21 ,  G06N20/00

Abstract: Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

公开(公告)号：US11327726B2

公开(公告)日：2022-05-10

申请号：US16945321

申请日：2020-07-31

Applicant: Microsoft Technology Licensing, LLC

Inventor： Yu Wang ,  Yu Hu ,  Haiyuan Cao ,  Hui Su ,  Jinchao Li ,  Xinying Song ,  Jianfeng Gao

IPC: G06F8/35 ,  G06F16/901 ,  G06F8/70

Abstract: A workflow engine tool is disclosed that enables scientists and engineers to programmatically author workflows (e.g., a directed acyclic graph, “DAG”) with nearly no overhead, using a simpler script that needs almost no modifications for portability among multiple different workflow engines. This permits users to focus on the business logic of the project, avoiding the distracting tedious overhead related to workflow management (such as uploading modules, drawing edges, setting parameters, and other tasks). The workflow engine tool provides an abstraction layer on top of workflow engines, introducing a binding function that converts a programming language function (e.g., a normal python function) into a workflow module definition. The workflow engine tool infers module instances and induces edge dependencies automatically by inferring from a programming language script to build a DAG.

公开(公告)号：US20190340030A1

公开(公告)日：2019-11-07

申请号：US15972968

申请日：2018-05-07

Applicant: Microsoft Technology Licensing, LLC

Inventor： Xinying Song ,  Jaideep Sarkar ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Hui Su ,  Jinchao Li ,  Andreea Bianca Spataru

IPC: G06F9/50 ,  G06F9/48

Abstract: Generally discussed herein are devices, systems, and methods for task routing. A method can include receiving, from a resource, a request for a task, in response to receiving the request, determining whether to retrieve a new task of new tasks stored in a first queue or a backlog task of backlog tasks stored in a second queue based on a combined amount of backlog tasks and new tasks relative to a capacity of the resource or the resources, retrieving the new task or the backlog task from the determined first queue or second queue, respectively, based on the determination, and providing the retrieved task to the resource.