Results 1  10
of
2,251
A Discrete Binary Version of The Particle Swarm Algorithm
 PROC. OF CONF. ON SYSTEM, MAN, AND CYBERNETICS, 4104–4109
, 1997
"... The particle swarm algorithm adjusts the trajectories of a population of “particles” through a problem space on the basis of information about each particle’s previous best performance and the best previous performance of its neighbors. Previous versions of the particle swarm have operated in contin ..."
Abstract

Cited by 339 (2 self)
 Add to MetaCart
in continuous space, where trajectories are defined as changes in position on some number of dimensions. The present paper reports a reworking of the algorithm to operate on discrete binary variables. In the binary version, trajectories are changes in the probability that a coordinate will take on a zero or one
Binary Version Management for Computational Grids
, 1999
"... Applications are no longer monolithic files, but rather a collection of dynamically linked libraries, images, fonts, etc. For such applications to function correctly, all of the required files must be available and be the correct version. Missing files preclude application execution, and incorrect v ..."
Abstract
 Add to MetaCart
Applications are no longer monolithic files, but rather a collection of dynamically linked libraries, images, fonts, etc. For such applications to function correctly, all of the required files must be available and be the correct version. Missing files preclude application execution, and incorrect
The SimpleScalar tool set, version 2.0
 Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract

Cited by 1844 (43 self)
 Add to MetaCart
This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces
Unsupervised Learning by Probabilistic Latent Semantic Analysis
 Machine Learning
, 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of cooccurren ..."
Abstract

Cited by 618 (4 self)
 Add to MetaCart
Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of co
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
the convergence the more exact the approximation. • If the hidden nodes are binary, then thresholding the loopy beliefs is guaranteed to give the most probable assignment, even though the numerical value of the beliefs may be incorrect. This result only holds for nodes in the loop. In the maxproduct (or "
Dynamo: A Transparent Dynamic Optimization System
 ACM SIGPLAN NOTICES
, 2000
"... We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT ..."
Abstract

Cited by 479 (2 self)
 Add to MetaCart
native binaries can be accelerated Dynamo, and often by a significant degree. For example, the average performance of O optimized SpecInt95 benchmark binaries created by the HP product C compiler is improved to a level comparable to their O4 optimized version running without Dynamo. Dynamo achieves
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization
"... Abstract Particle Swarm Optimization (PSO) is one of the most widely used heuristic algorithms. The simplicity and inexpensive computational cost make this algorithm very popular and powerful in solving wide ranges of problems. However, PSO suffers two problems of trapping in local minima and slow ..."
Abstract
 Add to MetaCart
convergence speed. Binary version of this algorithm has been introduced for solving binary problems. Because BPSO uses the same concepts of PSO, it also undergoes the same problems. The main part of the binary version is the transfer function. There is not enough study in the literature focusing
Binary operations applied to functions
 Journal of Formalized Mathematics
, 1989
"... Summary. In the article we introduce functors yielding to a binary operation its composition with an arbitrary functions on its left side, its right side or both. We prove theorems describing the basic properties of these functors. We introduce also constant functions and converse of a function. The ..."
Abstract

Cited by 299 (43 self)
 Add to MetaCart
of the ordered pair assigned by the function. In the case of functions defined on a nonempty set we redefine the above mentioned functors and prove simplified versions of theorems proved in the general case. We prove also theorems stating relationships between introduced concepts and such properties of binary
SeaView version 4: A multiplatform graphical user interface for sequence alignment and phylogenetic tree building
 Mol Biol Evol
, 2010
"... We present SeaView version 4, a multiplatform program designed to facilitate multiple alignment and phylogenetic tree building from molecular sequence data through the use of a graphical user interface. SeaView version 4 combines all the functions of the widely used programs SeaView (in its previous ..."
Abstract

Cited by 319 (0 self)
 Add to MetaCart
previous versions) and Phylo_win, and expands them by adding network access to sequence databases, alignment with arbitrary algorithm, maximumlikelihood tree building with PhyML, and display, printing, and copytoclipboard of rooted or unrooted, binary or multifurcating phylogenetic trees. In relation
Results 1  10
of
2,251