Minimum-process coordinated checkpointing is a suitable approach to introduce fault tolerance in mobile distributed systems transparently. In order to balance the checkpointing overhead and the loss of computation on recovery, the authors propose a hybrid checkpointing algorithm, wherein an all-process coordinated checkpoint is taken after the execution of minimum-process coordinated checkpoint...

The Minimum Spanning Tree Problem (MSTP) is one of the most known combinatorial optimization problems. It concerns the determination of a minimum edge-cost subgraph spanning all the vertices of a given connected graph. The Quadratic Minimum Spanning Tree Problem (QMSTP) is a variant of the MST whose cost considers also the interaction between every pair of edges of the tree. In this paper we re...

We propose a goal-oriented evaluation measure, Hierarchy Quality, for hierarchical clustering algorithms applied to the task of organizing search results -such as the clusters generated by Vivisimo search engine-. Our metric considers the content of the clusters, their hierarchical arrangement, and the effort required to find relevant information by traversing the hierarchy starting from the to...

one of the basic principles of an experiment is the repetition of its treatments so that treatments cannot be statistically compared without repetition. using enough replications has a great impact on scientific validity, but in most cases, not enough attention is paid. generally, selecting the number of replications is done according to previous experiments at similar conditions, regarding the...

We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/dynamic constraints, or minimum clearance, and relaxed definitions of the goal state, to be used when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra’s shortest path algorithm which all...

in this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using b-spline curves. the trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. due to gait design considerations it is desired to minimize the required torques in a cycle of gait. similar to caterpillars,...

Nowadays, B2B integration still remains a big cost driver for companies. On the one hand, standardization efforts were able to reduce the mapping effort between e-Business schemas. However, the effort for creating customized messages from the huge and underspecified standard templates increased. Due to the myriad of different requirements by different companies, a great variety of standards coe...

Consider people dividing their time and effort between friends, interest clubs, and reading seminars. These are all reciprocal interactions, and the reciprocal processes determine the utilities of the agents from these interactions. To advise on efficient effort division, we determine the existence and efficiency of the Nash equilibria of the game of allocating effort to such projects. When no ...

The Traveler's Dilemma game and the Minimum Effort Coordination game are two social dilemmas that have attracted considerable attention due to the fact that the predictions of classical game theory are at odds with the results found when the games are studied experimentally. Moreover, a direct application of deterministic evolutionary game theory, as embodied in the replicator dynamics, to thes...