A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
An algorithm for solving the jump number problem

1988
*
Discrete Mathematics
*

In this paper, we present

doi:10.1016/0012-365x(88)90224-5
fatcat:nqj6mrgo6zfnzpaux2ret2m5gm
*an**algorithm**for**solving**the**jump**number**problem*on arbitrary posets which extends*the*author's approach applied to N-free posets and makes use of two new types of greedy chains ... Conclusions We have presented*the**algorithm**for**solving**the**jump**number**problem*which is linear in*the*poset size and factorial in k,*the**number*of dummy arcs in arc representations of posets. ...##
###
Integer Programming Based Algorithms for Peg Solitaire Problems
[chapter]

2001
*
Lecture Notes in Computer Science
*

*The*

*algorithms*first

*solve*relaxed

*problems*and get

*an*upper bound of

*the*

*number*of

*jumps*

*for*$\mathrm{e}\mathrm{a}\mathrm{c}1_{1}$

*jump*position. ... We proposed

*algorithms*based on

*the*backtrack search method and relaxation methods

*for*integer programming

*problem*. ...

*The*second

*algorithm*uses

*the*properties of a peg solitaire

*problem*that

*the*

*number*of

*jumps*required to

*solve*

*the*

*problem*is known and

*solving*

*the*

*problem*in forward direction is essentially equivalent ...

##
###
Developing New Algorithm And Its Application On Optimal Control Of Pumps In Water Distribution Network

2015
*
Zenodo
*

In recent years, new techniques

doi:10.5281/zenodo.1109231
fatcat:vz7rl6ckkjhonivlljgos2z47m
*for**solving*complex*problems*in engineering are proposed. One of these techniques is JPSO*algorithm*. ... Maximum*number*of status on and off*for*each pumps imposed to*the*objective function as another constraint. ...*JUMPING*PSO (JPSO) In this method,*the*situation of a particle X x , x , … , x (s is*the**number*of decision variables) is studied as*an*acceptable response*for*combined optimal*problem*. ...##
###
The Level Ancestor Problem simplified

2004
*
Theoretical Computer Science
*

We present a simple

doi:10.1016/s0304-3975(04)00117-3
fatcat:uxk3qkkesngypaejqf5n4kz4iu
*algorithm**for**the*Level Ancestor*Problem*. A Level Ancestor Query LA(v; d) requests*the*depth d ancestor of node v. ...*The*Level Ancestor*Problem*is to preprocess a given rooted tree T to support level ancestor queries. ... This ÿnishes*the**problem*of ÿnding a level ancestor within a microtree.*The*micro node may want*an*ancestor outside of its microtree. ...##
###
Developing New Algorithm (G-JPSO) for Optimal Control of Pumps in Water Distribution Networks

2018
*
Scientia Iranica. International Journal of Science and Technology
*

However, in order to achieve more robust performance,

doi:10.24200/sci.2018.20703
fatcat:klypdatk6vgq7ki7mzcbhhqj5q
*the*probability to*solve**the*graph-based*problems*is modified by changing*the**jumping*nature of this*algorithm*and a new*algorithm*called G-JPSO is ... Meta-heuristic methods have been widely used*for**solving*complex*problems*recently. Among these methods, JPSO is regarded as a promising*algorithm*. ... as*an*acceptable response*for**the*combined optimal*problem*. ...##
###
Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm

2018
*
Journal of the Operational Research Society
*

*The*version in

*the*Kent Academic Repository may differ from

*the*final published version. Users are advised to check http://kar.kent.ac.uk

*for*

*the*status of

*the*paper. ... Users should always cite

*the*published version of record. ... Acknowledgments

*The*first author would like to thank EPSRC

*for*her PhD studentship. ...

##
###
The Level Ancestor Problem simplified

2004
*
Theoretical Computer Science
*

We present a simple

doi:10.1016/j.tcs.2003.05.002
fatcat:3l6qrlec5bhgvducwmir7cigyq
*algorithm**for**the*Level Ancestor*Problem*. A Level Ancestor Query LA(v; d) requests*the*depth d ancestor of node v. ...*The*Level Ancestor*Problem*is to preprocess a given rooted tree T to support level ancestor queries. ... This ÿnishes*the**problem*of ÿnding a level ancestor within a microtree.*The*micro node may want*an*ancestor outside of its microtree. ...##
###
Numerical Algorithms for Deterministic Impulse Control Models with Applications

2012
*
Social Science Research Network
*

*The*first (new)

*algorithm*considers

*an*Impulse Control

*problem*as a (multipoint) Boundary Value

*Problem*and uses a continuation technique to

*solve*it. ... As

*an*application we

*solve*a forest management

*problem*and a dike heightening

*problem*. ...

*for*a fixed

*number*of

*jumps*(see e.g. ...

##
###
Energy-Level Jumping Algorithm for Global Optimization in Compressive Sensing-Based Target Localization

2019
*
Sensors
*

*Solving*global optimization

*for*

*the*sparse recovery

*problem*remains a challenge in CS-based target localization. ... By repeating

*the*process of energy-level

*jumping*, our proposed

*algorithm*establishes a global convergence path from

*an*initial point to

*the*global minimizer. ... Author Contributions: T.W. and G.L. contributed on

*the*whole idea of

*the*method, proposed

*the*

*algorithm*. X.G. and X.W. performed

*the*experiments, H.S. analyzed

*the*data. ...

##
###
Opposition-based Differential Evolution with protective generation jumping

2011
*
2011 IEEE Symposium on Differential Evolution (SDE)
*

*The*Opposition-based Differential Evolution (ODE)

*algorithm*has shown to be superior to its parent, Differential Evolution (DE)

*algorithm*in

*solving*many real-world

*problems*and benchmark functions efficiently ... Generation

*Jumping*(ODEPGJ), in which it makes

*the*ODE

*algorithm*more adaptive in term of generation

*jumping*. ... DE is

*an*efficient

*algorithm*in

*solving*global optimization

*problems*, but it has

*problems*with, as well, it is prone to curse of dimensionality. ...

##
###
Parallel Algorithms for Two Processors Precedence Constraint Scheduling
[chapter]

2008
*
Encyclopedia of Algorithms
*

*The*work of Jung, Serna, and Spirakis provides a parallel

*algorithm*(on a PRAM machine) that

*solves*

*the*above

*problem*

*for*

*the*particular case that m = 2, that is where there are two parallel processors ... Clearly topological sort will accomplish

*the*above partition, and this can be done by

*an*NC

*algorithm*that uses O(n 3 ) processors and O(log n) time, see [3] . ... Auxiliary

*problems*

*The*

*algorithm*

*for*

*the*two processors precedence constraint scheduling

*problem*uses as a building block

*an*

*algorithm*

*for*

*solving*a matching

*problem*in a particular graph class. ...

##
###
Optimization of reactor network design problem using Jumping Gene Adaptation of Differential Evolution

2015
*
Journal of Physics, Conference Series
*

*The*standard deviation and

*the*variance values obtained using DE-JGa, DE and MDE

*algorithms*also show that

*the*DE-JGa

*algorithm*gives consistent set of results

*for*

*the*majority of

*the*test

*problems*and ... Extensive computational comparisons have been made

*for*all

*the*chemical engineering

*problems*considered. ... Differential evolution in brief Differential evolution (DE),

*an*evolutionary

*algorithm*is

*an*extension of genetic

*algorithm*(GA)

*for*

*solving*single objective optimization

*problems*. ...

##
###
A NEW TWO-STAGE METHOD FOR NONPARAMETRIC REGRESSION WITH JUMP POINTS
[chapter]

2008
*
World Scientific Series on Nonlinear Science Series A
*

This approximation

doi:10.1142/9789812790576_0004
fatcat:hawdzhy6yvgrfjpodoegzhz4v4
*problem*is formulated as*an*optimization*problem*which can be*solved*by many existing techniques.*The*method is applied to several examples. ... In this chapter, a two-staged method is presented*for*nonparametric regression with*jump*points. ... [11] proposed*an**algorithm*to estimate regression functions when discontinuities are present. [20] used one-sided moving average to find*the*locations of*jumps*, [9] used Fourier analysis*for**jump*...##
###
Page 1059 of Mathematical Reviews Vol. , Issue 91B
[page]

1991
*
Mathematical Reviews
*

This

*solves**the**jump**number**problem**for*biconvex graphs by means of computational geometry. ... It is known that,*for*posets P,; and P with*the*same comparability graph,*the**jump**numbers*of P,; and P, also coincide and that*for*chordal bipartite graphs*the**jump**number*decision*problem*is NP-complete ...##
###
Opposition based red wolf algorithm for solving optimal reactive power problem

2021
*
International Journal of Advances in Applied Sciences
*

<p>This paper presents

doi:10.11591/ijaas.v10.i3.pp193-197
fatcat:ub4nn4hmyfaatet5lrgykobvh4
*an*opposition based red wolf optimization (ORWO)*algorithm**for**solving*optimal reactive power*problem*. ... Each red wolf has a flag vector in*the**algorithm*, and length is equivalent to*the*whole sum of*numbers*which features in*the*dataset of*the*wolf optimization (WO). ... This paper proposes*an*opposition based red wolf optimization (ORWO)*algorithm**for**solving*optimal reactive power*problem*. ...
« Previous

*Showing results 1 — 15 out of 146,047 results*