Sciweavers

925 search results - page 62 / 185
» A Solution to the Extended GCD Problem
Sort
View
GECCO
2003
Springer
155views Optimization» more  GECCO 2003»
14 years 2 months ago
Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
Kwong-Sak Leung, Yong Liang
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
14 years 1 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
14 years 1 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
14 years 1 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
14 years 1 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He