Mutual scheduling of events on handheld computers
First Claim
Patent Images
1. A method for scheduling an event between at least two computer devices through a peer to peer communication network, the method comprising:
- polling by one of the at least two computer devices for presence of other computer devices of the at least two computer devices;
initiating a request to schedule the event on the at least two computer devices;
in response to initiating the request,exchanging available time slots and non-available time slots among the at least two computer devices, wherein one or more of the available time slots and non-available time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the available time slots and non-available time slots are from a second different computer device of the at least two computer devices;
generating at least one consolidated schedule by comparing the available time slots and the non-available time slots; and
displaying the consolidated schedule on the user interfaces of the at least two computer devices in order to allow the users of the at least two computer devices to confirm the scheduling of the event within the consolidated schedule;
wherein the method is performed by one or more computing devices.
0 Assignments
0 Petitions
Accused Products
Abstract
An embodiment of the invention provides a method for scheduling an event. The method includes signaling a request from a first computer to schedule an event to a second computer. A schedule is then received from the second, the schedule includes indicators of available time periods in the calendar period from the second computer. A consolidated schedule is then generated. The consolidated schedule comprises information comparing the indicators of available time periods from the second computer with indicators of available time periods from the first computer.
-
Citations
71 Claims
-
1. A method for scheduling an event between at least two computer devices through a peer to peer communication network, the method comprising:
-
polling by one of the at least two computer devices for presence of other computer devices of the at least two computer devices; initiating a request to schedule the event on the at least two computer devices; in response to initiating the request, exchanging available time slots and non-available time slots among the at least two computer devices, wherein one or more of the available time slots and non-available time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the available time slots and non-available time slots are from a second different computer device of the at least two computer devices; generating at least one consolidated schedule by comparing the available time slots and the non-available time slots; and displaying the consolidated schedule on the user interfaces of the at least two computer devices in order to allow the users of the at least two computer devices to confirm the scheduling of the event within the consolidated schedule; wherein the method is performed by one or more computing devices. - View Dependent Claims (2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
6. A method for scheduling by a computer device an event with one or more other computer devices, the method comprising:
-
detecting presence of the one or more other computer devices; receiving a request, initiated by one of users of the computer device and the one or more other computer devices, to schedule the event; in response to receiving the request, receiving time slots of the one or more other computer devices from the one or more other computer devices, wherein one or more of the time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the time slots are from a second different computer device of the at least two computer devices; generating a consolidated schedule by comparing time slots of the computer device and the time slots of the one or more other computer device; and displaying the consolidated schedule on a user interface of the computer device for a user of the computer device to confirm the scheduling of the event within the consolidated schedule; wherein the method is performed by one or more computing devices.
-
-
20. A system for scheduling an event, comprising:
-
a peer to peer communication network; at least two computer devices coupled to the peer to peer communication network; at least two or more computer processors; a non-transitory computer-readable storage medium comprising stored sequences of instructions which, when executed by one or more of the at least two or more processors, cause the one or more of the at least two or more processors to carry out the steps of; polling by one of the at least two computer devices for presence of other computer devices of the at least two computer devices; initiating a request to schedule the event on the at least two computer devices; in response to initiating the request, exchanging available time slots and non-available time slots among the at least two computer devices, wherein one or more of the available time slots and non-available time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the available time slots and non-available time slots are from a second different computer device of the at least two computer devices; generating at least one consolidated schedule by comparing the available time slots and the non-available time slots; and displaying the consolidated schedule on the user interfaces of the at least two computer devices in order to allow the users of the at least two computer devices to confirm the scheduling of the event within the consolidated schedule. - View Dependent Claims (21, 22, 23, 24)
-
-
25. A computer device for scheduling an event with one or more other computer devices, comprising:
-
at least two or more computer processors; a non-transitory computer-readable storage medium comprising stored sequences of instructions which, when executed by one or more of the at least two or more processors, cause the one or more of the at least two or more processors to carry out the steps of; detecting presence of the one or more other computer devices; receiving a request, initiated by one of users of the computer device and the one or more other computer devices, to schedule the event; in response to receiving the request, receiving time slots of the one or more other computer devices from the one or more other computer devices, wherein one or more of the time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the time slots are from a second different computer device of the at least two computer devices; generating a consolidated schedule by comparing time slots of the computer device and the time slots of the one or more other computer device; and displaying the consolidated schedule on a user interface of the computer device for a user of the computer device to confirm the scheduling of the event within the consolidated schedule. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38)
-
-
39. Non-transitory computer-readable storage media storing instructions executed by two or more processors to carry out:
-
polling by one of at least two computer devices for presence of other computer devices of the at least two computer devices; initiating a request to schedule an event on the at least two computer devices; in response to initiating the request, exchanging available time slots and non-available time slots among the at least two computer devices, wherein one or more of the available time slots and non-available time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the available time slots and non-available time slots are from a second different computer device of the at least two computer devices; generating at least one consolidated schedule by comparing the available time slots and the non-available time slots; and displaying the consolidated schedule on the user interfaces of the at least two computer devices in order to allow the users of the at least two computer devices to confirm the scheduling of the event within the consolidated schedule. - View Dependent Claims (40, 41, 42, 43)
-
-
44. A non-transitory computer-readable storage medium storing instructions executed by one or more processors of a computer device to carry out:
-
detecting presence of one or more other computer devices; receiving a request, initiated by one of users of the computer device and the one or more other computer devices, to schedule an event; in response to receiving the request, receiving time slots of the one or more other computer devices from the one or more other computer devices, wherein one or more of the time slots are from a first computer device of the at least two computer devices, and wherein one or more others of the time slots are from a second different computer device of the at least two computer devices; generating a consolidated schedule by comparing time slots of the computer device and the time slots of the one or more other computer device; and displaying the consolidated schedule on a user interface of the computer device for a user of the computer device to confirm the scheduling of the event within the consolidated schedule. - View Dependent Claims (45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57)
-
-
58. A non-transitory computer-readable storage medium storing instructions executed by one or more processors to carry out:
-
transmitting a signal between a first computer and a second computer to request to schedule one or more new events; wherein a first scheduling application that resides on the first computer has a first set of events; wherein a second scheduling application that resides on the second computer has a second set of events; programmatically generating a consolidated schedule of available time periods of the first scheduling application and available time periods of the second scheduling application; wherein programmatically generating a consolidated schedule includes comparing versions of different sets of events, said versions including a version of the first set of events and a version of the second set of events; using the consolidated schedule to schedule a proposed event; wherein the proposed event is not a member of any version of any set of events compared to generate the consolidated schedule; the first computer transmitting a request to the second computer to schedule the proposed event; the first computer receiving a message from the second computer; if the message indicates that the proposed event can be scheduled, causing the first computer to update the first scheduling application to reflect that the proposed event is scheduled, wherein the second scheduling application has been updated to reflect that the proposed event is scheduled; and if the message indicates that the proposed event cannot be scheduled, then the first computer causing no update to the first scheduling application. - View Dependent Claims (59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71)
-
Specification