147 search results - page 10 / 30 » The Uncapacitated Swapping Problem |
COCOA
2009
Springer
14 years 4 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
CPAIOR
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
LCPC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
SWAP
2007
13 years 11 months ago
2007
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating ...
IPCO
2001
13 years 11 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...