13376 search results - page 404 / 2676 » Problem Solving with |
160
click to vote
OSN
2007
15 years 4 months ago
2007
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
153
click to vote
COR
2011
14 years 11 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
134
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
124
click to vote
BIBE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
136
click to vote
WSC
2004
15 years 6 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...