2244 search results - page 27 / 449 » A new heuristic approach for non-convex optimization problem... |
156
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
199
click to vote
COMCOM
2007
15 years 5 months ago
2007
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
166
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
141
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
166
click to vote
ISLPED
1999
ACM
15 years 10 months ago
1999
ACM
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...