1940 search results - page 83 / 388 » Search with Synonyms: Problems and Solutions |
172
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
179
click to vote
TEC
2010
15 years 1 months ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
175
click to vote
IJCAI
2003
15 years 7 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
197
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
150
click to vote
AAAI
2000
15 years 7 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...