Sciweavers

2657 search results - page 223 / 532
» On the complexity of hierarchical problem solving
Sort
View
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
15 years 5 months ago
PSO and multi-funnel landscapes: how cooperation might limit exploration
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
Andrew M. Sutton, Darrell Whitley, Monte Lunacek, ...
MP
2008
135views more  MP 2008»
15 years 1 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
FGCS
2007
106views more  FGCS 2007»
15 years 1 months ago
A parallel hybrid genetic algorithm for protein structure prediction on the computational grid
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
ICCAD
2006
IEEE
130views Hardware» more  ICCAD 2006»
15 years 10 months ago
On bounding the delay of a critical path
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
Leonard Lee, Li-C. Wang
JMLR
2010
144views more  JMLR 2010»
14 years 8 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...