Sciweavers

1921 search results - page 213 / 385
» The Student-Project Allocation Problem
Sort
View
EVOW
2005
Springer
16 years 2 days ago
Automated Photogrammetric Network Design Using the Parisian Approach
We present a novel camera network design methodology based on the Parisian approach to evolutionary computation. The problem is partitioned into a set of homogeneous elements, whos...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
CAV
2001
Springer
107views Hardware» more  CAV 2001»
15 years 11 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
AIPS
2006
15 years 8 months ago
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
AAAI
2000
15 years 8 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
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...
Holger H. Hoos, Craig Boutilier
EOR
2006
76views more  EOR 2006»
15 years 6 months ago
Location of slaughterhouses under economies of scale
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
John v. d. Broek, Peter Schütz, Leen Stougie,...