1984 search results - page 58 / 397 » Variable mesh optimization for continuous optimization probl... |
119
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
111
click to vote
MANSCI
2010
14 years 8 months ago
2010
Businesses often need to face the problem of providing incentives for employees to work together effectively on projects that develop over time. This paper derives the optimal con...
DAGSTUHL
2004
15 years 3 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
129
click to vote
JC
2006
15 years 1 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
115
click to vote
WSCG
2004
15 years 3 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...