The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper is devoted to the exact resolution of a strongly NP-hard resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance,...
We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space spanned...
We present in this article two components: these components can in fact serve various goals
independently, though we consider them here as an ensemble. The first component is a technique for
the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and
parabolic) partial differential equations with affine parameter dependence.
The essential features are (i) (provably) rapidly convergent global
reduced–basis approximations — Galerkin projection onto a space
WN spanned...
We define an agent-oriented abstraction formalism devoted to generalized theories of abstraction that have been proposed in Artificial Intelligence. The model we propose extends the abstraction capabilities of the existing Agent-Oriented Programming paradigm. This short note reviews first the existing attempts to define abstraction in AI and in agent systems. Then, our model is introduced in terms of six definitions covering the concepts of agents, annotated knowledge, utility and society of agents....
Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is
gratefully acknowledged.In a distributed server architecture an obvious question is
where to deploy the components. Host recommendation, which gives the
answer, faces problems such as server selection, host deployment and, in
case of multimedia servers, video replication. It is especially relevant for
the Adaptive Distributed...
Introspection is the prerequisite of autonomic behavior, the first step towards performance improvement and resource usage optimization for large-scale distributed systems. In grid environments, the task of observing the application behavior is assigned to monitoring systems. However, most of them are designed to provide general resource information and do not consider specific information for higher-level services. More precisely, in the context of data-intensive applications, a specific introspection...
This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely....
Proving properties of distributed algorithms is still a highly challenging problem and various approaches that have been proposed to tackle it [1] can be roughly divided into state-based and event-based proofs. Informally speaking, state-based approaches define the behavior of a distributed algorithm as a set of sequences of memory states during its executions, while event-based approaches treat the behaviors by means of events which are produced by the executions of an algorithm. Of course, combined...
The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data...
The value of knowing about data availability and system accessibility
is analyzed through theoretical models of Information Economics.
When a user places an inquiry for information, it is important for the user to
learn whether the system is not accessible or the data is not available, rather
than not have any response. In reality, various outcomes can be provided
by the system: nothing will be displayed to the user (e.g., a traffic light that
does not operate, a browser that keeps browsing, a telephone...
Currently displaying 1 –
18 of
18