Returns true if this address does not contain a physical address, only a name.

A bug fix for all JDK code including 1.2. nextGaussian can theoretically ask for the log of 0 and divide it by 0! See Java bug <a hr

Determine the node number from the given genome position. Function arguments refer to node numbers. Inputs are numbered from [0, numInputs - 1]. Funct

Return the number of simulation have done with current individual.

Finds the next nonblank line, skips past an expected preamble, and reads in an integer if there is one, and returns it. Generates an error oth

Removes the agent from the base. <b>Look out!</b> The method that calls this method will not exit, the thread will not be stopped as a result. It only

Calculates the fitness for the SS (Sensitivity/specificity) type fitness. Gets the raw fitness and then normalizes between 0 and max value (maxValue S

Returns the default base.

Doesn't do anything.

Computes max possible gene value for the given position. Min gene value is assumed to always be zero. The max value depends on the phenotype of the gi

Loads the number of threads.

Creates a message and fires it. @param recipient Recipient of the message. @param type Type of the message. @param contstr The string content of the m

generate the lambdaTree that represents a natural number in the Church numeral form. @param state @param theInt the natural number you want to convert

Given an individual calculate the true positive (TP), false negative (FN), false positive (FP) and true negative (TN) values of the model formed by th

Doesn't do anything.

Joins the n pieces and sets the genome to their concatenation. The default form does nothing. It should be trivial to implement it f

Loads given file. Calls <code>Properties.load</code> with a file input stream to the given file.

Returns true if a < b, else false

lambda should be no SMALLER than mu times this value. This varies between (mu,lambda) (where it's 2) and (mu + lambda) (where it's 1)

This method is for completness' sake. Returns a long drawn uniformly from 0 to n-1. Suffice it to say, n must be greater than 0, or

Returns true if I'm better than _fitness. The rule I'm using is this: if I am better in one or more criteria, and we are equal in the others, then bet

Divides an array of Individuals into the Pareto front and the "nonFront" (everyone else). The Pareto front is returned. You may provide ArrayLists fo

Returns 0 if the IntBag is empty, else removes and returns the topmost int.

Format method for the d conversion specifer and short argument. For d format, the flag character '-', means that the output should be left justified

Should print the fitness out in a computer-readable fashion, with a verbosity of Output.V_NO_GENERAL.

Format method for the o conversion character and short argument. For o format, the flag character '-', means that the output should be left justified

Format method for the x conversion character and short argument. For x format, the flag character '-', means that the output should be left justified

Gets peers from the collective.

This method allows the recipient of the message to send a reply object when handling the message. This object is sent back to the sender. <p>The objec

Copy the values provided so the data for the (only) dependent variable is available as required. Also calculate a set of useful statistical values for

Returns the standardized fitness metric.

Usually called after setup(), startFresh() calls the initializers of the EvolutionState modules, effectively enabling a EvolutionState to start evolv

Tests the Individual to see if its values are in range.

Returns the depth at which I appear in the tree, which is a value >= 0. O(ln n) avg.

Deep-clones the tree rooted at this node, and returns the entire copied tree. The result has everything set except for the root node'

Closes the connection, ie the streams and the socket. @throws IOException if any closing operation throws one

Constructs a solution by greedily adding the lowest-desirability component at each step until a complete solution is formed. The pheromone matrix arg

Create the node if the nodeList do not have that node.The nodes in the nodeList is guarantee in ascending order according to node's nodeId.

Destroys an agent with all necessary clean up. The method {@link IAgent#onDestruction()} will be called before removing the agent from the base. The a

Called after produce(...), usually once a generation, or maybe only once if you're doing steady-state evolution (at the end of the run).

This returns a reference through which information about the hosting DRM can be requested. @throws ClassCastException If the IDRM interface is not imp

Implementations can use this function to return additional information about the request. @param q the string id of the requested information @return

Returns the current number of choices to the node.

Returns the objectives as an array. Note that this is the actual array . Though you could set values in this array, you should NOT do this -- rather,

Returns the root address.

The base tries to go online on one of the ports from the given range (inclusive the limits). Being online means that the base starts to listen to inco

Determine whether a given specifies a complete solution to this problem. @param solution A partial or complete solution to this ConstructiveProblemFo

Prints out all the parameters in the database, but not shadowed parameters.

Loads the original and creates a new blank image to scribble on, and a new graphics object.

Provides a brand-new individual to fill in a population. The default form simply calls clone(), creates a fitness, sets evaluated to false,

Returns a random float in the half-open range from [0.0f,1.0f). Thus 0.0f is a valid result but 1.0f is not.

Returns the p'th node, constrained by nodesearch, in the subtree for which this GPNode is root. Use numNodes(nodesearch) to determine

For each gene in the genome create an expression tree from the Karva expression encoded in the gene. The expression tree is used to evaluate the expre

Pops off <i>n</i> items from the stack, if possible. Returns the number of items actually popped off.

Finds the next nonblank line, skips past an expected preamble, and reads in a double if there is one, and returns it. Generates an error othe

Reads trials in from DataInput.

Returns the root ancestor of this node. O(ln n) average case, O(n) worst case.

Starts the run. <i>condition</i> indicates whether or not the run was restarted from a checkpoint (C_STARTED_FRESH vs C_STARTED_FROM

Always returns null

Splits the genome into n pieces, according to points, which must be sorted. pieces.length must be 1 + points.length. The default form does n