16082 search results - page 374 / 3217 » Fireworks Algorithm for Optimization |
140
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
139
click to vote
CSREASAM
2006
15 years 6 months ago
2006
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
119
click to vote
AIPS
2003
15 years 6 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
136
click to vote
APSCC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
154
click to vote
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...