Sciweavers

212 search results - page 27 / 43
» queue 2010
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
EOR
2010
110views more  EOR 2010»
14 years 9 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
JSAC
2010
142views more  JSAC 2010»
14 years 4 months ago
Handling inelastic traffic in wireless sensor networks
The capabilities of sensor networking devices are increasing at a rapid pace. It is therefore not impractical to assume that future sensing operations will involve real time (inela...
Jiong Jin, Avinash Sridharan, Bhaskar Krishnamacha...
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 4 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
ANOR
2010
77views more  ANOR 2010»
14 years 9 months ago
Time-dependent analysis for refused admissions in clinical wards
For capacity planning issues in health care, such as the allocation of hospital beds, the admissions rate of patients is commonly assumed to be constant over time. In addition to ...
René Bekker, A. M. de Bruin