Scheduling one or more users via potential calendars is presented. In preparing a potential schedule request, one or more potential time slots in which the to-be scheduled event may be held are identified. The potential schedule is sent to the scheduled users and the potential time slots for the potential schedule event are added to the users' calendars. In response to clarifying information, one or more potential time slots of the potential schedule request may be removed from consideration for the potential schedule event. A selection is made regarding a potential time slot for the potential schedule event and the potential schedule event is promoted to the explicit calendars of the scheduled users to be held at the selected potential time slot. In promoting the potential schedule event to the explicit calendars, the potential event is removed from the potential calendars, including any remaining potential time slots.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A computer-implemented method for providing a scheduling service for scheduling one or more users according to a schedule request from an originating user, the method comprising: providing a potential calendar for each user of a plurality of users, the plurality of users including at least the originating user and a receiving user, wherein each user is associated with a respective explicit calendar that is maintained at least in part by the user, and wherein each potential calendar is maintained by the scheduling service; receiving a potential schedule request from the originating user for a potential schedule event with the receiving user, the potential schedule request comprising a plurality of potential time slots occurring over a time period in which the potential schedule event may be conducted between the originating user and the receiving user; adding the potential schedule event to the potential calendar of both the originating user and the receiving user, wherein adding the potential schedule event to the potential calendar includes adding the plurality of potential time slots to the potential calendar; while one of the plurality of potential time slots has not been selected for the potential schedule event, iteratively reducing the plurality of potential time slots to a single potential time slot by: determining an affected potential time slot of the potential schedule event, the affected potential time slot including one of the plurality of potential time slots included in the potential schedule event with a date and time occurring before a current date and time, and automatically removing the affected potential time slot from the potential schedule event of the potential calendar of the originating user and the potential calendar of the receiving user; automatically selecting the single potential time slot for the potential schedule event when the single potential time slot is the only potential time slot of the plurality of potential time slots that has not been removed; automatically adding an actual schedule event based on the potential schedule event to the explicit calendar of the originating user and the explicit calendar of the receiving user at the single potential time slot, the explicit calendar of the originating user and the explicit calendar of the receiving user distinct from the potential calendar of the originating user and the potential calendar of the receiving user, wherein the explicit calendar of the originating user and the explicit calendar of the receiving user are automatically modified to place the actual schedule event into an actual time slot corresponding to the single potential time slot, wherein the actual time slot in the explicit calendar of the originating user and the explicit calendar of the receiving user remain available prior to adding the actual schedule event, and wherein responsive to placing the actual schedule event into the actual time slot, the actual time slot is removed from consideration for other potential schedule events; and releasing the potential schedule event from the potential calendar of the originating user and the potential calendar of the receiving user.
2. The computer-implemented method of claim 1 , wherein the affected potential time slot is determined based on obtained clarifying information regarding the potential schedule event, the clarifying information comprising data affecting or relevant to scheduling the potential schedule event.
This invention relates to computer-implemented scheduling systems that dynamically adjust time slots for events based on clarifying information. The problem addressed is the inefficiency of static scheduling systems that do not adapt to real-time changes in event details, leading to conflicts or suboptimal scheduling. The method involves obtaining clarifying information about a potential schedule event, which includes data that affects or is relevant to scheduling. This information may include participant availability, event duration, location constraints, or priority levels. The system then determines an affected potential time slot by analyzing this clarifying information to identify the most suitable time for the event. This dynamic adjustment ensures that scheduling decisions are based on up-to-date and relevant factors, improving efficiency and reducing conflicts. The method may also involve generating a schedule that incorporates the adjusted time slot, ensuring that the final schedule reflects the latest available information. By continuously updating scheduling decisions based on clarifying information, the system avoids rigid scheduling conflicts and optimizes event placement. This approach is particularly useful in environments where event details frequently change, such as corporate calendars, healthcare appointments, or educational institutions. The invention enhances scheduling accuracy and adaptability, leading to better resource utilization and user satisfaction.
3. The computer-implemented method of claim 2 , wherein the clarifying information comprises newly added calendar information from the originating user or the receiving user.
This invention relates to computer-implemented methods for enhancing communication by incorporating clarifying information, specifically newly added calendar information from either the originating user or the receiving user. The method addresses the problem of ambiguous or incomplete messages in digital communication, where context or scheduling details may be missing, leading to misunderstandings or inefficiencies. The method involves detecting a need for clarification in a message exchange between users. Once identified, the system prompts the users to provide additional context or details. The clarifying information includes calendar data, such as meeting times, deadlines, or availability, which is dynamically added to the conversation. This ensures that both parties have the necessary scheduling information to resolve ambiguities and improve communication accuracy. The system may automatically extract relevant calendar entries or allow manual input from the users. The newly added calendar information is then integrated into the message thread, making it accessible to all participants. This approach streamlines coordination by reducing the need for follow-up messages and minimizing delays caused by unclear scheduling details. By leveraging calendar data, the method enhances productivity in collaborative environments, such as business communications or team projects, where timely and precise information exchange is critical. The invention improves user experience by providing a seamless way to incorporate scheduling context directly into conversations.
4. The computer-implemented method of claim 2 , wherein the clarifying information comprises newly removed calendar information from the originating user or the receiving user.
This invention relates to computer-implemented methods for managing calendar information in communication systems. The problem addressed is the need to provide context or clarification when calendar-related information is removed or modified, ensuring that users involved in a communication exchange have accurate and up-to-date scheduling details. The method involves detecting when calendar information is removed from a communication exchange between an originating user and a receiving user. Upon detection, the system automatically generates clarifying information based on the newly removed calendar data. This clarifying information is then provided to the receiving user to inform them of the change. The system may also track the removal of calendar entries, such as appointments or events, and use this data to generate contextual updates for the communication thread. The method ensures that users are notified of changes to shared calendar information, preventing misunderstandings or scheduling conflicts. By automatically generating and delivering clarifying information, the system enhances communication efficiency and reduces the need for manual updates. The approach is particularly useful in collaborative environments where calendar data is frequently shared and modified.
5. The computer-implemented method of claim 2 , wherein the clarifying information comprises user preferences with regard to one or more potential time slots.
This invention relates to a computer-implemented method for scheduling or time management, specifically addressing the challenge of efficiently organizing and prioritizing time slots based on user preferences. The method involves generating clarifying information that includes user preferences regarding one or more potential time slots. These preferences may encompass factors such as availability, priority, or suitability for specific activities. The system processes this clarifying information to refine scheduling decisions, ensuring that proposed time slots align with the user's preferences. This approach enhances the accuracy and personalization of scheduling systems, reducing conflicts and improving user satisfaction. The method may integrate with broader scheduling algorithms to dynamically adjust proposed time slots based on real-time user input or historical data. By incorporating user preferences into the scheduling process, the invention aims to optimize time management by minimizing manual adjustments and improving the relevance of suggested time slots.
6. The computer-implemented method of claim 5 , wherein the user preferences with regard to the one or more potential time slots is returned in response to a poll requesting user preferences.
This invention relates to a computer-implemented method for managing user preferences in scheduling systems, particularly for optimizing time slot selection based on user input. The method addresses the challenge of efficiently gathering and processing user preferences for available time slots, ensuring that scheduling decisions align with individual or group preferences. The method involves receiving a poll that requests user preferences regarding one or more potential time slots. These time slots may be for meetings, appointments, or other scheduled events. The system then processes the poll to determine the user's preferences, which could include factors like availability, preferred times, or constraints. The preferences are then returned in response to the poll, allowing the system or a scheduling tool to use this data to select the most suitable time slot. The method may also involve analyzing the returned preferences to identify conflicts or overlaps, ensuring that the final selected time slot accommodates as many users as possible. Additionally, the system may prioritize preferences based on user roles, importance, or other criteria to refine the selection process. The method ensures that scheduling decisions are data-driven and user-centric, improving efficiency and satisfaction in collaborative or individual scheduling scenarios.
7. The computer-implemented method of claim 2 , wherein the clarifying information comprises a passage of time such that some potential time slots are no longer available or viable.
This invention relates to scheduling systems that dynamically adjust available time slots based on elapsed time. The problem addressed is the need to automatically filter out time slots that become unavailable or no longer viable due to the passage of time, ensuring that scheduling systems present only relevant options to users. The method involves a computer system that tracks time and evaluates the availability of time slots for scheduling purposes. When a user or another system requests scheduling options, the system checks the current time and removes any time slots that have already passed or are no longer feasible due to time constraints. This ensures that only valid, future time slots are presented for selection. The system may also account for other factors, such as user preferences or external constraints, to further refine the available options. By dynamically filtering time slots based on elapsed time, the system improves efficiency and reduces errors in scheduling processes. This is particularly useful in applications like appointment booking, resource allocation, or event planning, where outdated options can lead to confusion or wasted resources. The method ensures that users are only presented with practical and actionable time slots, enhancing the overall scheduling experience.
8. The computer-implemented method of claim 1 , wherein the receiving user is a user that received the schedule request from the originating user.
This invention relates to a computer-implemented method for managing schedule requests between users in a scheduling system. The problem addressed is the need to efficiently handle and process schedule requests, particularly ensuring that the receiving user is properly identified and notified of the request. The method involves a scheduling system that facilitates communication between an originating user and a receiving user. The originating user sends a schedule request to the receiving user, and the system ensures that the receiving user is the one who originally received the request. The system may include steps such as generating the schedule request, transmitting it to the receiving user, and confirming that the receiving user is the intended recipient. This ensures that the request is properly routed and that the receiving user is aware of the pending request, reducing errors and improving scheduling efficiency. The method may also involve additional features such as tracking the status of the request, notifying the receiving user of the request, and allowing the receiving user to respond to the request. The system may use various communication channels, such as email, messaging platforms, or calendar applications, to facilitate the exchange of schedule requests. The invention aims to streamline the scheduling process by ensuring accurate recipient identification and timely notifications, thereby improving user experience and reducing scheduling conflicts.
9. A non-transitory computer-readable medium bearing computer-executable instructions which, when executed on a computing system comprising at least a processor, carry out a method of providing a scheduling service for scheduling users, the method comprising: providing a potential calendar for each user of a plurality of users, the plurality of users including at least an originating user and a receiving user, wherein each user is associated with a respective explicit calendar that is maintained at least in part by the user, and wherein each potential calendar is maintained by the scheduling service; receiving a potential schedule request from the originating user for a potential schedule event with the receiving user, the potential schedule request comprising a plurality of potential time slots occurring over a time period in which the potential schedule event may be conducted between the originating user and the receiving user; adding the potential schedule event to the potential calendar of both the originating user and the receiving user, wherein adding the potential schedule event to the potential calendar includes adding the plurality of potential time slots to the potential calendar; while one of the plurality of potential time slots has not been selected for the potential schedule event, iteratively reducing the plurality of potential time slots to a single potential time slot by: determining an affected potential time slot of the potential schedule event, the affected potential time slot including one of the plurality of potential time slots included in the potential schedule event with a date and time occurring before a current date and time, and automatically removing the affected potential time slot from the potential schedule event of the potential calendar of the originating user and the potential calendar of the receiving user; automatically selecting the single potential time slot for the potential schedule event when the single potential time slot is the only potential time slot of the plurality of potential time slots that has not been removed; automatically adding an actual schedule event based on the potential schedule event to the explicit calendar of the originating user and the explicit calendar of the receiving user at the single potential time slot, the explicit calendar of the originating user and the explicit calendar of the receiving user distinct from the potential calendar of the originating user and the potential calendar of the receiving user, wherein the explicit calendar of the originating user and the explicit calendar of the receiving user are automatically modified to place the actual schedule event into an actual time slot corresponding to the single potential time slot, wherein the actual time slot in the explicit calendar of the originating user and the explicit calendar of the receiving user remain available prior to adding the actual schedule event, and wherein responsive to placing the actual schedule event into the actual time slot, the actual time slot is discarded as a potential time slot for other potential schedule events; and releasing the potential schedule event from the potential calendar of the originating user and the potential calendar of the receiving user.
This invention relates to a scheduling service that automates the process of selecting a meeting time between users. The system addresses the challenge of coordinating schedules by reducing the burden of manual back-and-forth communication when arranging meetings. The service maintains separate potential calendars for each user, distinct from their explicit (personal) calendars, to track tentative time slots for a proposed event. When an originating user submits a potential schedule request, the system adds multiple proposed time slots to the potential calendars of both the originating and receiving users. Over time, the system iteratively removes outdated time slots (those that have passed) until only one viable option remains. Once a single time slot is left, the system automatically selects it and transfers the event to the users' explicit calendars, marking the time as booked and unavailable for other requests. This approach streamlines scheduling by eliminating manual confirmation steps and ensuring that only the finalized time slot is added to users' primary calendars. The system also ensures that potential time slots remain available for other scheduling attempts until the final selection is made.
10. The non-transitory computer-readable medium of claim 9 , wherein the affected potential time slot is determined based on obtained clarifying information regarding the potential schedule event, the clarifying information comprising data affecting or relevant to scheduling the potential schedule event.
A system and method for scheduling events involves determining an affected potential time slot for a schedule event based on clarifying information. The clarifying information includes data relevant to scheduling the event, such as participant availability, location constraints, or event duration. The system obtains this clarifying information to refine the scheduling process, ensuring that the selected time slot aligns with the event's requirements. This approach improves scheduling accuracy by dynamically adjusting the time slot selection based on real-time or pre-existing data, reducing conflicts and optimizing resource allocation. The system may also integrate with calendar applications or other scheduling tools to automate the process, enhancing efficiency in managing multiple events. The method ensures that the scheduling decision accounts for all relevant factors, minimizing disruptions and improving coordination among participants.
11. The non-transitory computer-readable medium of claim 10 , wherein the clarifying information comprises any one or more of: newly added calendar information from the originating user or the receiving user; newly removed calendar information from the originating user or the receiving user; and user preferences with regard to one or more potential time slots.
This invention relates to calendar management systems that facilitate scheduling by providing clarifying information to users. The problem addressed is the difficulty in coordinating schedules between multiple users, particularly when calendar information is incomplete or ambiguous. The system enhances calendar data by incorporating additional details to help users make informed scheduling decisions. The invention involves a computer-readable medium storing instructions for processing calendar data. The system generates clarifying information to resolve scheduling conflicts or ambiguities. This clarifying information may include newly added calendar entries from either the originating or receiving user, newly removed calendar entries from either user, or user preferences regarding potential time slots. By analyzing these changes and preferences, the system helps users identify suitable meeting times more efficiently. The invention improves upon existing calendar systems by dynamically updating and presenting relevant scheduling data, reducing the need for manual coordination and back-and-forth communication. This approach streamlines the scheduling process, making it faster and more reliable for users.
12. The non-transitory computer-readable medium of claim 10 , wherein the clarifying information comprises a passage of time such that some potential time slots are no longer available or viable.
This invention relates to scheduling systems that use clarifying information to refine available time slots for appointments or events. The problem addressed is the inefficiency in scheduling when initial time slots are proposed without considering real-time constraints, leading to wasted time and conflicts. The system improves scheduling by dynamically adjusting available time slots based on clarifying information, such as the passage of time, which renders some slots no longer available or viable. The clarifying information may include time-based constraints, such as deadlines or time-sensitive availability, ensuring that only feasible options are presented. The system may also incorporate user preferences, historical data, or external factors to further refine scheduling options. By dynamically updating the available time slots in response to clarifying information, the system enhances efficiency and reduces scheduling conflicts. The invention is particularly useful in applications where time-sensitive decisions are critical, such as medical appointments, business meetings, or resource allocation. The system may be implemented as part of a software application or integrated into existing scheduling platforms to improve accuracy and user experience.
13. A computer system that provides a scheduling service for scheduling an event, the computer system comprising: a processor, wherein the processor, through execution of instructions stored in a memory as part of or in conjunction with additional components to respond to a search query, is configured to: manage calendar data for one or more computer users, including a potential calendar for each of the one or more computer users, receive a potential schedule request from an originating user in regard to a potential schedule event, the potential schedule request comprising a plurality of potential time slots occurring over a time period, and schedule the potential schedule event for the originating user and a receiving user; while one of the plurality of potential time slots has not been selected for the potential schedule event, iteratively reduce the plurality of potential time slots to a single potential time slot by: identifying an affected potential time slot associated with the potential schedule event that is affected, the affected potential time slot including one of the plurality of potential time slots included in the potential schedule event with a date and time occurring before a current date and time, and automatically removing the affected potential time slot from the potential schedule event of the potential calendar of the originating user and the potential calendar of the receiving user; automatically select the single potential time slot for the potential schedule event when the single potential time slot is the only potential time slot of the plurality of potential time slots that has not been removed; automatically add an actual schedule event based on the potential schedule event to an explicit calendar of the originating user and an explicit calendar of the receiving user at the single potential time slot, wherein the explicit calendar of the originating user and the explicit calendar of the receiving user are maintained at least in part by the originating user and the receiving user, respectively, and are distinct from the potential calendar of the originating user and the potential calendar of the receiving user which are maintained by the scheduling service, wherein the explicit calendar of the originating user and the explicit calendar of the receiving user are automatically modified to place the actual schedule event into an actual time slot corresponding to the single potential time slot, wherein the actual time slot in the explicit calendar of the originating user and the explicit calendar of the receiving user remain available prior to adding the actual schedule event, and wherein responsive to placing the actual schedule event into the actual time slot, the actual time slot is determined to be unavailable for other potential schedule events; and release the potential schedule event from the potential calendar of the originating user and the potential calendar of the receiving user.
This invention relates to a computer system for scheduling events, addressing the challenge of coordinating multiple potential time slots between users to finalize a meeting or event. The system manages calendar data for multiple users, including both potential and explicit calendars. Potential calendars are maintained by the scheduling service and contain tentative time slots, while explicit calendars are user-maintained and reflect confirmed events. When an originating user submits a potential schedule request with multiple time slots, the system iteratively narrows down the options by removing affected time slots—those that have passed the current date and time—from both the originating and receiving users' potential calendars. Once only one time slot remains, it is automatically selected and converted into an actual schedule event, which is then added to the explicit calendars of both users. The explicit calendars are updated to reflect the confirmed event, marking the corresponding time slot as unavailable for future scheduling. The system ensures efficient scheduling by dynamically eliminating outdated options and automating the transition from tentative to confirmed events, reducing manual coordination efforts.
14. The computer system of claim 13 , wherein the affected potential time slot is identified based on obtained clarifying information regarding the potential schedule event, the clarifying information comprising data affecting or relevant to scheduling the potential schedule event.
This invention relates to computer systems for scheduling events, particularly addressing the challenge of efficiently identifying and resolving scheduling conflicts or ambiguities in a calendar system. The system obtains clarifying information about a potential schedule event, such as user preferences, availability constraints, or external factors, to determine the most appropriate time slot for the event. This clarifying information may include data that directly affects scheduling, such as user availability, event duration, or conflicting appointments, or data that is relevant but not directly scheduling-related, such as user preferences or external constraints. By analyzing this information, the system identifies an affected potential time slot, ensuring that the event is scheduled in a manner that minimizes conflicts and aligns with user needs. The system may also integrate with other scheduling tools or databases to gather additional context, improving the accuracy of the scheduling decision. This approach enhances the efficiency and reliability of automated scheduling, reducing the need for manual intervention and improving user satisfaction.
15. The computer system of claim 14 , wherein the clarifying information comprises a passage of time such that some potential time slots are no longer available or viable.
A computer system is designed to manage scheduling and resource allocation by dynamically adjusting available time slots based on real-time constraints. The system includes a scheduling module that evaluates potential time slots for appointments, tasks, or resource bookings. To improve accuracy and relevance, the system incorporates clarifying information that refines the available options. This clarifying information may include a passage of time, which eliminates certain time slots that are no longer available or viable due to prior commitments, resource unavailability, or other temporal constraints. The system dynamically updates the scheduling options in response to this information, ensuring that only feasible time slots are presented to users. This approach enhances efficiency by reducing the need for manual adjustments and minimizing conflicts in scheduling. The system may also integrate with external data sources, such as calendars or databases, to gather additional context that further refines the available time slots. By continuously evaluating and updating the scheduling options, the system optimizes resource allocation and improves user experience in time-sensitive applications.
16. The computer system of claim 13 , wherein the processor is configured to repeatedly receive and process clarifying information regarding the potential schedule event prior to the selection of the selected single potential time slot.
This invention relates to a computer system for scheduling events, specifically addressing the challenge of efficiently managing and confirming potential schedule events before finalizing a time slot. The system includes a processor that repeatedly receives and processes clarifying information about a potential schedule event before a user selects a single time slot. This clarifying information may include details such as event duration, participant availability, or other relevant constraints. The processor dynamically adjusts the proposed schedule based on this input, ensuring that the final selected time slot aligns with all specified requirements. The system may also integrate with other scheduling tools or databases to verify availability and resolve conflicts in real-time. By continuously refining the schedule before final selection, the invention improves accuracy and reduces the need for post-selection adjustments, enhancing overall scheduling efficiency. The processor's ability to handle iterative clarifications ensures that the selected time slot is optimized for all participants, minimizing scheduling errors and conflicts. This approach is particularly useful in environments where multiple stakeholders must coordinate schedules, such as corporate meetings, medical appointments, or collaborative projects. The system may also include user interfaces for inputting clarifying information and displaying updated schedule options, ensuring transparency and ease of use.
17. The computer system of claim 16 , wherein the clarifying information comprises newly added calendar information from the originating user or the receiving user.
This invention relates to computer systems for managing and enhancing communication clarity, particularly in messaging or scheduling applications. The problem addressed is the ambiguity or lack of context in digital communications, which can lead to misunderstandings or inefficiencies. The system improves communication by automatically identifying unclear or ambiguous messages and prompting users to provide additional clarifying information. This clarifying information can include newly added calendar information from either the originating user (the sender) or the receiving user. By integrating calendar data, the system helps resolve scheduling conflicts or uncertainties, ensuring that all parties have the necessary context to understand the communication fully. The system may also analyze message content to detect ambiguity and suggest relevant clarifications, such as event details, time zones, or availability. The goal is to reduce miscommunication and streamline interactions by leveraging structured data like calendar entries to provide context automatically. This approach is particularly useful in professional or collaborative environments where precise communication is critical.
18. The computer system of claim 16 , wherein the clarifying information comprises newly removed calendar information from the originating user or the receiving user.
This invention relates to a computer system for managing and clarifying communication data, particularly calendar information, to improve user interactions. The system addresses the problem of incomplete or ambiguous calendar data that can lead to misunderstandings or scheduling conflicts between users. The system automatically identifies and clarifies missing or outdated calendar information by analyzing communication patterns and user behavior. The system includes a data processing module that extracts calendar data from user communications, such as emails or messages, and determines whether the information is sufficient for scheduling purposes. If gaps or ambiguities are detected, the system generates clarifying information by cross-referencing the calendar data with other available sources, such as user profiles or historical interactions. This clarifying information may include newly removed calendar entries from either the originating user or the receiving user, ensuring that all parties have the most up-to-date scheduling details. The system also includes a user interface that presents the clarified calendar information in a structured format, allowing users to quickly verify and update their schedules. The interface may highlight discrepancies or changes, such as canceled meetings or rescheduled events, to prevent conflicts. Additionally, the system may send automated notifications to users when clarifying information is generated, ensuring timely updates. By integrating calendar data with communication analysis, the system enhances scheduling accuracy and reduces the risk of errors or miscommunications. This is particularly useful in collaborative environments where multiple users need to coordinate schedules efficiently. The system’s ability to detect and r
19. The computer system of claim 16 , wherein the clarifying information comprises user preferences with regard to one or more potential time slots.
This invention relates to a computer system for scheduling and managing time slots, particularly addressing the challenge of efficiently organizing and presenting available time slots to users while incorporating their preferences. The system includes a user interface that displays potential time slots for an event or activity, along with clarifying information to help users make informed decisions. The clarifying information includes user preferences regarding one or more potential time slots, such as preferred days, times, or durations. The system may also generate and display a ranked list of time slots based on these preferences, ensuring that the most suitable options are prioritized. Additionally, the system can receive user input to refine or adjust the displayed time slots, allowing for dynamic updates based on real-time feedback. The system may also integrate with external calendars or scheduling tools to provide a comprehensive view of availability and conflicts. By incorporating user preferences directly into the time slot selection process, the system enhances user satisfaction and efficiency in scheduling.
20. The computer system of claim 19 , wherein the user preferences with regard to the one or more potential time slots is returned in response to a poll requesting user preferences.
A computer system is designed to manage and optimize scheduling by collecting and processing user preferences for potential time slots. The system includes a user interface for receiving input from users regarding their availability and preferences for scheduling events. The system also includes a processing module that analyzes the received user preferences to determine optimal time slots for scheduling based on the collected data. Additionally, the system may include a communication module for transmitting the processed user preferences to other systems or users. The user preferences with regard to the one or more potential time slots are returned in response to a poll requesting user preferences. This allows for dynamic and real-time updates to scheduling decisions, ensuring that the most current and relevant information is used. The system may also include a storage module for storing user preferences and historical data, which can be used to improve future scheduling decisions. The overall goal is to streamline the scheduling process by automating the collection and analysis of user preferences, reducing manual effort and improving efficiency.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
November 30, 2015
March 15, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.