Sciweavers

1080 search results - page 88 / 216
» Problem dependent optimization (PDO)
Sort
View
FOIKS
2008
Springer
15 years 6 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler
HPN
1998
15 years 5 months ago
Nondeterministic Classifier Performance Evaluation for Flow Based IP Switching
In modern IP networks, processing cost in network nodes is considered as a bottleneck. This problem is tackled with traffic based IP switching. The performance of traffic based IP...
Jouni Karvo, Mika Ilvesmäki
JSS
2008
65views more  JSS 2008»
15 years 4 months ago
Process pipeline scheduling
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
Melissa Lemos, Marco A. Casanova, Antonio L. Furta...
INFOCOM
1999
IEEE
15 years 8 months ago
Resource Allocation in a Multicast Tree
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
Murali S. Kodialam, Steven H. Low
CPC
2008
135views more  CPC 2008»
15 years 4 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs