Sciweavers

3415 search results - page 580 / 683
» Lower Bounds for Kernelizations
Sort
View
JEC
2006
113views more  JEC 2006»
13 years 10 months ago
CyNC: A method for real time analysis of systems with cyclic data flows
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
Henrik Schiøler, Jens Dalsgaard Nielsen, Ki...
JPDC
2006
106views more  JPDC 2006»
13 years 10 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
EOR
2007
80views more  EOR 2007»
13 years 10 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
OL
2008
79views more  OL 2008»
13 years 10 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
PAMI
2008
181views more  PAMI 2008»
13 years 10 months ago
Automatic Estimation and Removal of Noise from a Single Image
Image denoising algorithms often assume an additive white Gaussian noise (AWGN) process that is independent of the actual RGB values. Such approaches cannot effectively remove colo...
Ce Liu, Richard Szeliski, Sing Bing Kang, C. Lawre...