4539 search results - page 194 / 908 » Approaches to Compute Workflow Complexity |
144
click to vote
APWEB
2010
Springer
15 years 7 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
123
click to vote
AAAI
2008
15 years 6 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
128
click to vote
TON
2002
15 years 4 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
163
click to vote
SISAP
2010
IEEE
15 years 2 months ago
2010
IEEE
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
158
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...