نتایج جستجو برای: many plans
تعداد نتایج: 997330 فیلتر نتایج به سال:
Theories of inter-organisational co-ordination propose that information processing capabilities (structure, process and technology) must be aligned with information processing needs (environmental, partnership and task uncertainty), and that the fit between both is a strong determinant of performance. Electronic marketplaces dominate new developments in electronic commerce. While traditional mo...
This paper considers the incentive compatibility in many-to-many two-sided matching problems. We first show that the Blocking Lemma holds for many-to-many matchings under the extended max-min preference criterion and quota-saturability condition. This result extends the Blocking Lemma for one-to-one matching and for many-to-one matching to many-to-many matching problem. It is then shown that th...
For large-scale multimedia distributions, multicast is the preferred method of communication. ASM (Any Source Multicast) and SSM (SourceSpecific Multicast) are the two types of multicast used. ASM is designed for either many-to-many or one-to-many communication. SSM is derived from ASM. SSM is used when only one session member is allowed to send data. An example use of SSM could be an IPTV broa...
We develop a model of many-to-many matching with contracts which subsumes as special cases many-to-many matching markets and buyer–seller markets with heterogeneous and indivisible goods. In our setting, substitutable preferences are sufficient to guarantee the existence of stable outcomes; moreover, in contrast to results for the setting of many-to-one matching with contracts, if any agent’s p...
Large scale maps are available for many countries. The building ground plans of those maps can be helpful for the reconstruction of 3D building models from laser data and aerial images. This paper presents two studies on 3D building reconstruction. The first study combines data of a laser scanner with a high point density with the ground plans. The reconstruction approach is data driven. The se...
Medicare private fee-for-service (PFFS) plans are paid like other Medicare Advantage (MA) plans but are exempt from many MA requirements. Recently, Congress set average payments well above the costs of traditional fee-for-service (FFS) Medicare, inducing dramatic increases in PFFS plan enrollment. This has significant implications for Medicare's budget, provoking calls for policy change. We pre...
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a domain-independent approach to solving this problem. We propose different domain independent distance functions among plans that can provide meaningful insights about the diversity in the plan set. We then describe how t...
We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...
This paper presents a provably correct and ef®cient, polynomial time, planning tool and its application to a miniature assembly line for toy cars. Although somewhat limited, this process has many similarities with real industrial processes. One of our previous polynomial-time planning algorithms has been extended and adapted to work for a larger class of planning problems, including this partic...
We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید