Patents by Inventor Ritesh Madan
Ritesh Madan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230410039Abstract: Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.Type: ApplicationFiled: August 25, 2023Publication date: December 21, 2023Inventors: Vivek Farias, Aryan Iden Khojandi, Ritesh Madan, Chad Yan, Guang Yang
-
Patent number: 11775927Abstract: Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.Type: GrantFiled: January 19, 2021Date of Patent: October 3, 2023Assignee: NIKE, Inc.Inventors: Vivek Farias, Aryan Iden Khojandi, Ritesh Madan, Chad Yan, Guang Yang
-
Publication number: 20230021223Abstract: Methods and systems for event prediction. The system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data may be communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module may receive a prediction query and, in response, supply an event prediction based on the prediction model.Type: ApplicationFiled: September 20, 2022Publication date: January 19, 2023Inventors: Ying-zong Huang, Vishal Doshi, Balaji Rengarajan, Vasudha Shivamoggi, Devavrat Shah, Ritesh Madan
-
Patent number: 11481644Abstract: A system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data is communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module receives a prediction query and, in response, supplies an event prediction based on the prediction model.Type: GrantFiled: December 17, 2017Date of Patent: October 25, 2022Assignee: NIKE, Inc.Inventors: Ying-zong Huang, Vishal Doshi, Balaji Rengarajan, Vasudha Shivamoggi, Devavrat Shah, Ritesh Madan
-
Patent number: 11126956Abstract: Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.Type: GrantFiled: May 15, 2018Date of Patent: September 21, 2021Assignee: NIKE, Inc.Inventors: Vivek Farias, Aryan Iden Khojandi, Ritesh Madan, Chad Yan, Guang Yang
-
Publication number: 20210142267Abstract: Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.Type: ApplicationFiled: January 19, 2021Publication date: May 13, 2021Inventors: Vivek Farias, Aryan Iden Khojandi, Ritesh Madan, Chad Yan, Guang Yang
-
Publication number: 20190354920Abstract: Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.Type: ApplicationFiled: May 15, 2018Publication date: November 21, 2019Inventors: Vivek Farias, Aryan Iden Khojandi, Ritesh Madan, Chad Yan, Guang Yan
-
Publication number: 20190303774Abstract: Systems and methods for completing at least one entry in a dataset. The systems and methods described herein find a rich set of dense features for each of a plurality of entities, then combine the rich set of dense features with externally provided features to estimate a target value. The systems and methods combine these features using a neural network model in which portions of the input layer are each only connected to a portion of the hidden layer.Type: ApplicationFiled: March 29, 2019Publication date: October 3, 2019Inventors: Devavrat Shah, Sai Kiran Burle, Ritesh Madan
-
Publication number: 20180240024Abstract: Methods and systems for event prediction. The system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data may be communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module may receive a prediction query and, in response, supply an event prediction based on the prediction model.Type: ApplicationFiled: December 17, 2017Publication date: August 23, 2018Inventors: Ying-zong Huang, Vishal Doshi, Balaji Rengarajan, Vasudha Shivamoggi, Devavrat Shah, Ritesh Madan
-
Patent number: 8923157Abstract: Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows.Type: GrantFiled: November 3, 2008Date of Patent: December 30, 2014Assignee: QUALCOMM IncorporatedInventors: Arnab Das, Ritesh Madan, Sundeep Rangan, Sanjay Shakkottai, Siddharth Ray
-
Patent number: 7706283Abstract: A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.Type: GrantFiled: September 25, 2006Date of Patent: April 27, 2010Assignee: Mitsubishi Electric Research Laboratories, Inc.Inventors: Neelesh B. Mehta, Ritesh Madan, Andreas F. Molisch, Jinyun Zhang
-
Patent number: 7684337Abstract: A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.Type: GrantFiled: January 17, 2006Date of Patent: March 23, 2010Assignee: Mitsubishi Electric Research Laboratories, Inc.Inventors: Neelesh B. Mehta, Ritesh Madan, Andreas F. Molisch, Jinyun Zhang
-
Publication number: 20090122717Abstract: Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows.Type: ApplicationFiled: November 3, 2008Publication date: May 14, 2009Applicant: QUALCOMM IncorporatedInventors: Arnab Das, Ritesh Madan, Sundeep Rangan, Sanjay Shakkottai, Siddharth Ray
-
Publication number: 20080075007Abstract: A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically-varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.Type: ApplicationFiled: September 25, 2006Publication date: March 27, 2008Inventors: Neelesh B. Mehta, Ritesh Madan, Andreas F. Molisch, Jinyun Zhang
-
Publication number: 20070165581Abstract: A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.Type: ApplicationFiled: January 17, 2006Publication date: July 19, 2007Inventors: Neelesh Mehta, Ritesh Madan, Andreas Molisch, Jinyun Zhang