2244 search results - page 315 / 449 » A new heuristic approach for non-convex optimization problem... |
168
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
205
click to vote
TIP
2002
15 years 6 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
166
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
169
click to vote
CP
2007
Springer
16 years 17 days ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
157
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...