3433 search results - page 292 / 687 » Heuristics for a bidding problem |
203
click to vote
SAGA
2001
Springer
15 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
146
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
153
click to vote
NOMS
2000
IEEE
15 years 11 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
181
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
160
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...