Information Processing Letters 

About: Information Processing Letters is an academic journal. The journal publishes majorly in the area(s): Time complexity & Upper and lower bounds. It has an ISSN identifier of 0020-0190. Over the lifetime, 7676 publication(s) have been published receiving 180145 citation(s). The journal is also known as: Inf. Process. Lett..

A 2dvEv- bit distributed algorithm for the directed Euler trail problem

Abstract: A new distributed Euler trail algorithm is proposed to run on an Euler diagraph G(V,E) where each node knows only its adjacent edges, converting it into a new state that each node knows how an existent Euler trail routes through its incoming and outgoing edges. The communication requires only 2middot;|E| one-bit messages. The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist.

The particle swarm optimization algorithm: convergence analysis and parameter selection

Abstract: The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory. Graphical parameter selection guidelines are derived. The exploration-exploitation tradeoff is discussed and illustrated. Examples of performance on benchmark functions superior to previously published results are given.

An efficient algorith for determining the convex hull of a finite planar set

Abstract: Step Find a point Pin the plane w%ch is in &he In&$x of Cl-l(s). At worst, this can be done in clfl sQp9 by te dting 3 element subsets of S for collineti@, discarding middle p&n& of collinear rets ar5b bq@rig when the fust noncollinear set (if there i# or&j. &y X, y arrcf z, is found. P can be chosen to I&E the centroid oC the triangle formed by X, y and z. Sfq 2: Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P. This canversion can be done in c2n operations ior some rimed constant

A linear-time algorithm for testing the truth of certain quantified boolean formulas☆

Abstract: Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in conjunctive normal form. That is, C is a conjunction of clauses, each clause is a disjunction of literals, and each literal is either a variable, xi, or the negation of a variable, Zi (1 < i f n). We shall use Ui to denote a literal equal to either Xi or Fi. The evaluation problem for quantified Boolean formulas is to determine whether such a formula F is true. The evaluation problem is complete in polynomial space [6], even if C is restricted to contain at most three literals per clause. The satisfiability problem, the special case in which all quantifiers are existential, is NP-complete [ 1,2,4] for formulas with three literals per clause. However, the satisfiability problem for formulas with only two literals per clause is solvable in polynomial time [ 1,2,4] ; Even, Itai, and Shamir [3] outline a linear-time algorithm. Schaefer [5] claims a polynomial time bound for the evaluation problem with two literals per clause, although he gives no proof. In this note we present a simple constructive algorithm for the evaluation of formulas having two literals per clause, which runs in linear time on a random access machine.