Sciweavers

613 search results - page 53 / 123
» Finding and Fixing Faults
Sort
View
ECRTS
2010
IEEE
15 years 29 days ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...
COR
2010
124views more  COR 2010»
14 years 12 months ago
On tandem blocking queues with a common retrial queue
We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available...
Konstantin Avrachenkov, Uri Yechiali
DISOPT
2010
129views more  DISOPT 2010»
14 years 12 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
EOR
2006
81views more  EOR 2006»
14 years 12 months ago
Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding
In this paper we use policy-iteration to explore the behaviour of optimal control policies for lost sales inventory models with the constraint that not more than one replenishment...
Roger M. Hill, Søren Glud Johansen
ANOR
2005
83views more  ANOR 2005»
14 years 11 months ago
Optimal Consumption Portfolio and No-Arbitrage with Nonproportional Transaction Costs
In this paper we consider a finite-state financial market with non-proportional transaction cost and bid-ask spreads. The transaction cost consists of two parts: a fixed cost and a...
Xiuli Chao, K. K. Lai, Shouyang Wang, Mei Yu