Sciweavers

1220 search results - page 240 / 244
» Minimal Interval Completions
Sort
View
ENTCS
2008
153views more  ENTCS 2008»
13 years 7 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
SCHEDULING
2008
89views more  SCHEDULING 2008»
13 years 7 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
SIAMCO
2010
93views more  SIAMCO 2010»
13 years 6 months ago
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
TVCG
2010
151views more  TVCG 2010»
13 years 5 months ago
Uncertainty-Aware Guided Volume Segmentation
—Although direct volume rendering is established as a powerful tool for the visualization of volumetric data, efficient and reliable feature detection is still an open topic. Us...
Jörg-Stefan Praßni, Timo Ropinski, Klau...
WINET
2010
97views more  WINET 2010»
13 years 5 months ago
Routing in the frequency domain
Abstract The design of single transceiver based multichannel multi-hop wireless mesh networks focuses on the trade-off between rapid neighbor synchronization and maximizing the usa...
Jay A. Patel, Haiyun Luo, Indranil Gupta