10718 search results - page 362 / 2144 » On the Circuit Implementation Problem |
148
click to vote
GECCO
2003
Springer
16 years 22 hour ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
191
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
199
click to vote
ECP
1997
Springer
15 years 11 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
166
click to vote
NAA
2000
Springer
15 years 10 months ago
2000
Springer
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
160
Voted
CIE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...