Sciweavers

4430 search results - page 364 / 886
» Solving Optimization Problems with DLL
Sort
View
ICML
2002
IEEE
16 years 5 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
15 years 9 months ago
Rapid prototyping using evolutionary approaches: part 1
In this paper we describe a multi-objective problem solving approach, simultaneously minimizing average surface roughness Ra and build Time T, for object manufacturing by Rapid Pr...
Nikhil Padhye, Subodh Kalia
ICANN
2009
Springer
15 years 9 months ago
A Two Stage Clustering Method Combining Self-Organizing Maps and Ant K-Means
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
AAAI
2004
15 years 6 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck