Sciweavers

10718 search results - page 632 / 2144
» On the Circuit Implementation Problem
Sort
View
IJCAI
2003
15 years 8 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
186
Voted
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 8 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 2 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
235
Voted
CORR
2011
Springer
221views Education» more  CORR 2011»
15 years 2 months ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin
158
Voted
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
16 years 1 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell