Sciweavers

1289 search results - page 216 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
ATAL
2003
Springer
15 years 3 months ago
A principled study of the design tradeoffs for autonomous trading agents
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
Ioannis A. Vetsikas, Bart Selman
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 3 months ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
ASPDAC
2009
ACM
117views Hardware» more  ASPDAC 2009»
15 years 2 months ago
Dynamically reconfigurable on-chip communication architectures for multi use-case chip multiprocessor applications
– The phenomenon of digital convergence and increasing application complexity today is motivating the design of chip multiprocessor (CMP) applications with multiple use cases. Mo...
Sudeep Pasricha, Nikil Dutt, Fadi J. Kurdahi
SIGGRAPH
2010
ACM
15 years 2 months ago
Design and fabrication of materials with desired deformation behavior
This paper introduces a data-driven process for designing and fabricating materials with desired deformation behavior. Our process starts with measuring deformation properties of ...
Bernd Bickel, Moritz Bächer, Miguel A. Otaduy, Hy...