The ability to time intervals confers organisms, including humans, with many remarkable capabilities. A common method for studying interval timing is classification, in which a subject must indicate whether a given probe duration is nearer a previously learned short or long reference interval. This task is designed to reveal the probe duration that is equally likely to be labeled as short or lo...

In this paper, we propose two new hybrid methods for solving nonlinear equations, utilizing the advantages of classical (bisection, trisection, and modified false position), i.e., bisection-modified position (Bi-MFP) trisection-modified (Tri-MFP). We implemented proposed algorithms several benchmark problems. discuss graphical analysis these problems with respect to number iterations average CP...

In a graph G = (V,E), a bisection (X,Y ) is a partition of V into sets X and Y such that |X| ≤ |Y | ≤ |X|+1. The size of (X,Y ) is the number of edges between X and Y . In the Max Bisection problem we are given a graph G = (V,E) and are required to find a bisection of maximum size. It is not hard to see that ⌈|E|/2⌉ is a tight lower bound on the maximum size of a bisection of G. We study parame...