Sciweavers

1336 search results - page 194 / 268
» SMTP Path Analysis
Sort
View
COMPGEOM
2008
ACM
13 years 11 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
DOCENG
2008
ACM
13 years 11 months ago
Merging changes in XML documents using reliable context fingerprints
Different dialects of XML have emerged as ubiquitous document exchange formats. For effective collaboration based on such documents, the capability to propagate edit operations pe...
Sebastian Rönnau, Christian Pauli, Uwe M. Bor...
WSC
2004
13 years 11 months ago
Make-to-Stock Systems with Backorders: IPA Gradients
We consider single-stage, single-product Make-to-Stock systems with random demand and random service (production) rate, where demand shortages at the inventory facility are backor...
Yao Zhao, Benjamin Melamed
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 9 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
IVS
2006
240views more  IVS 2006»
13 years 9 months ago
Business process impact visualization and anomaly detection
Business operations involve many factors and relationships and are modeled as complex business process workflows. The execution of these business processes generates vast volumes ...
Ming C. Hao, Daniel A. Keim, Umeshwar Dayal, J&oum...