5595 search results - page 427 / 1119 » Comparing Subsumption Optimizations |
160
Voted
WSC
2004
15 years 8 months ago
2004
We develop a hierarchical distributed production planning and control methodology, called DISCS, for a large and unstable semiconductor manufacturing process. The upper layer of D...
216
Voted
AAAI
2000
15 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
148
click to vote
NIPS
2000
15 years 8 months ago
2000
We analyze the bit error probability of multiuser demodulators for directsequence binary phase-shift-keying (DS/BPSK) CDMA channel with additive gaussian noise. The problem of mul...
207
click to vote
CSC
2009
15 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
178
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...