Abstract: Systems and methods for scheduling events are described. In some embodiments, a method comprises: at a computer system, obtaining a request to schedule a calendar event including a plurality of constraints. In response to the request, a plurality of candidate calendar events that meets at least two of the plurality of constraints is obtained. The plurality of candidate calendar events and a plurality of user-editable options corresponding to the plurality of constraints are concurrently presented for display. In some embodiments, the method optionally includes obtaining, via a user-editable option, a modification to a constraint in the plurality of constraints which is then used to update the plurality of candidate calendar events. In some embodiments, the user-editable options are determined, at least in part, by user preferences. In some embodiments, the plurality of user-editable options further corresponds to a designation of one or more invitees to the scheduled calendar event.

Abstract: Systems and methods for scheduling events are described. In some embodiments, a method comprises: at a computer system, obtaining a request to schedule a calendar event including a plurality of constraints. In response to the request, a plurality of candidate calendar events that meets at least two of the plurality of constraints is obtained. The plurality of candidate calendar events and a plurality of user-editable options corresponding to the plurality of constraints are concurrently presented for display. In some embodiments, the method optionally includes obtaining, via a user-editable option, a modification to a constraint in the plurality of constraints which is then used to update the plurality of candidate calendar events. In some embodiments, the user-editable options are determined, at least in part, by user preferences. In some embodiments, the plurality of user-editable options further corresponds to a designation of one or more invitees to the scheduled calendar event.

Abstract: A method and system for scheduling or re-scheduling calendar events is described. One aspect of the invention involves: receiving a calendar search request to schedule a calendar event including at least one participant and a time of meeting constraint; obtaining information identifying one or more preferences associated with the at least one participant, at least one of the preferences based on the at least one participant's historical calendar activity over a predetermined period of time; searching one or more databases in a calendaring system to obtain a set of candidate calendar events that meet at least a subset of the plurality of constraints; ranking the set of candidate calendar events based on the plurality of constraints and the one or more preferences; and preparing for presentation at least a subset of the ranked set of candidate calendar events, each candidate calendar event including a specified start time.

Abstract: A method and system for scheduling or re-scheduling calendar events is described. One aspect of the invention involves: receiving a calendar search request to schedule a calendar event including at least one participant and a time of meeting constraint; obtaining information identifying one or more preferences associated with the at least one participant, at least one of the preferences based on the at least one participant's historical calendar activity over a predetermined period of time; searching one or more databases in a calendaring system to obtain a set of candidate calendar events that meet at least a subset of the plurality of constraints; ranking the set of candidate calendar events based on the plurality of constraints and the one or more preferences; and preparing for presentation at least a subset of the ranked set of candidate calendar events, each candidate calendar event including a specified start time.

Abstract: A series of iterative customer submissions and vendor responses are used to collect sufficient information concerning a custom manufacturing project so as to produce a sufficiently constrained job request as to allow at least one of the vendors to submit a quote for the project. The submissions and responses are preferably made through Web forms and, in one example, the custom manufacturing project is a print job. The collection process is preferably computer assisted so as to incrementally add constraints to an initially under-constrained job request to produce the sufficiently constrained job request.

Abstract: A data storage and retrieval mechanism includes a base table to store attributes common to each of the customer-specific variants and a spill-over table to store customer-specific attributes for associated individual ones of the customer-specific variants, the attributes of the base table and spill-over table each sharing a common, human readable name-referencing scheme. The customer-specific variants provide for corporate personalization of data storage, retrieval, and input and output operations/presentations as well as workflows that use such data. The name-referencing scheme may utilize multi-part names for data objects and such names may be used by other applications within the hosted environment for creating workflows, visual representations of the workflows, and/or data forms.

Abstract: The invention enables evaluation of the content of a set of data to determine whether the data set satisfies one or more queries. The invention enables rapid evaluation of large numbers of data sets much more rapidly than has previously been possible, even when the number of queries is large and/or the queries are complex. The queries are evaluated using an execution plan of query terms that is constructed from one or more specified queries by translating each query term of each query into one or more evidence descriptors and one or more combination operators, and operably relating each of the combination operators to at least one of the evidence descriptors or other combination operators, such that each query is defined by one or more of the evidence descriptors and one or more of the combination operators that are operably related to each other. Preferably, none of the evidence descriptors or combination operators are duplicated in the execution plan.