the tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and...
详细信息
Browsing web pages through wireless devices will be come more and more popular in the near future. However;accessing a large chunk of web data incurs a great amount of access latency while a mobile riser (MU) migrates...
详细信息
ISBN:
(纸本)0769509975
Browsing web pages through wireless devices will be come more and more popular in the near future. However;accessing a large chunk of web data incurs a great amount of access latency while a mobile riser (MU) migrates across cells. this paper investigates this problem and proposes an effective way of delivering such data to the MU in the ubiquitous computing systems. Our Data Delivery (D-2) strategy is based on the dynamic programming skill to preassign the user requested data on the possible visiting cells in order to reduce the access latency. We first design an encoding method for the cells, and then derive the properties of the encoding scheme. these properties are then used in our algorithm to deliver the data. Finally experiments are conducted to demonstrate the feasibility and efficiency of the proposed method.
Over the past decade, a large number of deductive object-oriented database languages have been proposed. the earliest of these languages had few object-oriented features. and more and more features have systematically...
详细信息
ISBN:
(纸本)0769509967
Over the past decade, a large number of deductive object-oriented database languages have been proposed. the earliest of these languages had few object-oriented features. and more and more features have systematically been incorporated in successive languages. However a language with a clean logical semantics that naturally accounts for all the key object-oriented features, is still missing from the literature. Two features that are currently missing are the encapsulation of rule-based methods in classes, and non-monotonic behavioral inheritance with overriding, conflict resolution and blocking. this paper introduces the syntax of a language withthese features. It then defines a class of databases, called well-defined databases, that have an intuitive meaning and develops a direct logical semantics for this class of databases. the semantics is based on the well-founded semantics from logic programming. the work presented in this paper establishes a firm logical foundation for deductive object-oriented databases.
In this paper we show, for the specific problem of test pattern optimisation, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone. We show...
详细信息
the Traveling Tournament Problem is a sports timetabling problem that abstracts two issues in creating timetables: home/away pattern feasibility and team travel. Instances of this problem seem to be very difficult eve...
详细信息
We present Branch-and-Check, a hybrid framework integrating Mixed Integer programming and Constraint Logic programming, which encapsulates the traditional Benders Decomposition and Branch-and-Bound as special cases. I...
详细信息
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance statio...
ISBN:
(纸本)3540428631
the aircraft assignment (or tail assignment) problem is to determine the routes flown by each aircraft in a given fleet, such that each flight is included in exactly one route and the aircraft visit maintenance stations according to regulations. Before this problem is solved, an airline has to: i) construct the timetable of flights, and ii) decide the aircraft type of each flight (fleet assignment). the aircraft assignment problem, thus, is a vehicle scheduling problem for a homogeneous fleet where all flight activities are fixed in time.
the temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint)from the e...
ISBN:
(纸本)3540428631
the temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint)from the environment, it executes withthis stimulus as the initial store, and when it reaches its resting point, it responds to the environment withthe resulting store. Also the resting point determines a residual process, which is then executed in the next time interval. this temporal ccp model is inherently deterministic and synchronous.
Constraint based techniques offer a promising approach to coordinating a set of agents in solving a distributed resource allocation problem. Distributed resource allocation is a general problem in which a set of agent...
ISBN:
(纸本)3540428631
Constraint based techniques offer a promising approach to coordinating a set of agents in solving a distributed resource allocation problem. Distributed resource allocation is a general problem in which a set of agents must intelligently assign their resources to a set of tasks such that all tasks are performed with respect to certain criteria. this problem arises in many real-world domains such as distributed sensor networks [4], disaster rescue[2], hospital scheduling[1], and others.
Withthe availability of Computational Grids, new kinds of applications that will soon emerge will raise the problem of how to program them on such computing systems. In this paper, we advocate a programming model tha...
详细信息
暂无评论