Sciweavers

388 search results - page 46 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 5 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
IHI
2010
169views Healthcare» more  IHI 2010»
14 years 6 months ago
Dynamic scheduling of emergency department resources
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
Junchao Xiao, Leon J. Osterweil, Qing Wang
ICC
2009
IEEE
137views Communications» more  ICC 2009»
14 years 9 months ago
Distributed Multi-User Scheduling for Improving Throughput of Wireless LAN
Carrier Sense Multi-Access (CSMA) is a typical method to share the common channel in a Wireless LAN (WLAN). It works fairly well in times of light traffic. However as the number of...
Suhua Tang, Ryu Miura, Sadao Obana
HEURISTICS
2010
14 years 9 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
15 years 6 months ago
Tool-support for the analysis of hybrid systems and models
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
Andreas Bauer 0002, Markus Pister, Michael Tautsch...