We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our real-world experimental results indicate that most elections cannot be manipulated by a few voters and agenda control is typically impossible. If the voter preference...

The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource constraints are satisfiedwhile achieving some objective. Priority rule-based heuristics are widely used for large problems. Rollout and justification can be integrated with priority rule heuristics to solve the RCPSP. We de...

In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the general computational properties for the problem of answering queries to such a p2p system. Finally, we devise tight complexity bounds and dis...

All approaches to high performance computing is naturally divided into three main directions: development of computational elements and their networks, advancement of computational methods and procedures, and evolution of the computed structures. In the paper the second direction is developed in the context of the theory of super-recursive algorithms. It is demonstrated that such super-recursiv...

The stability of iterative procedures plays an important role while solving the nonlinear equations obtained out of a physical problem using the advanced computational tools. The main purpose of this paper is to present a weaker stability result for Jungck-Ishikawa iteration process for a map satisfying some general contractive conditions in metric spaces. Some well known recent results are als...

WALTER S. STOLZ, PERCY H. TANNENBAUM AND t?I(EDERICK V. CARSTENSEN U~ive'rsity of Wisconsin, Madison, Wisconsin words to be encountered during tile text processing. More recently, a straight dietionalT approach has been supplemented througtl the use of computational decision procedures. The present paper reports on one such computational system, WISSYN, in which decisions about how to code cert...

In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the general computational properties for the problem of answering queries to such a p2p system. Finally, we devise tight complexity bounds and dis...

This paper presents improvements in the performance of standard genetic algorithms (GAs) as regards the solution of highly complex combinatorial optimization problems. These improvements are related to some modifications in the GA, including local search and/or diversification procedures. The performance of each proposed version is evaluated through a graph partitioning problem. Extensive compu...

Computer modelling and simulation have become increasingly important in many scientific and technological disciplines owing to the wealth of computational power. Calculation of the behaviour of these computational models is increasingly replacing experiments on real world objects—for example, in the car industry (tests based on simulated crashes) or in the development of nuclear weapons—and is ...

Procedures are introduced and discussed for increasing the computational and statistical efficiency of polynomial transformations used in Monte Carlo or simulation studies. Comparisons are also made between polynomials of order three and five in terms of (a) computational and statistical efficiency, (b) the skew and kurtosis boundary, and (c) boundaries for Pearson correlations. It is also show...