Sciweavers

5331 search results - page 138 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
OL
2007
121views more  OL 2007»
14 years 9 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
15 years 4 months ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
BMCBI
2006
113views more  BMCBI 2006»
14 years 10 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
TNN
1998
132views more  TNN 1998»
14 years 9 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
14 years 11 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi