2244 search results - page 266 / 449 » A new heuristic approach for non-convex optimization problem... |
171
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
202
click to vote
JAIR
2006
15 years 7 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
187
click to vote
ICCV
2007
IEEE
16 years 9 months ago
2007
IEEE
We address the problem of registering a sequence of images in a moving dynamic texture video. This involves optimization with respect to camera motion, the average image, and the ...
208
click to vote
JSA
2000
15 years 7 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
328
click to vote
SBIA
2010
Springer
15 years 5 months ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...