Sciweavers

8125 search results - page 1411 / 1625
» Parallelism and evolutionary algorithms
Sort
View
DSS
2006
93views more  DSS 2006»
15 years 4 months ago
Merging workflows: A new perspective on connecting business processes
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
Shuang Sun, Akhil Kumar, John Yen
JPDC
2006
156views more  JPDC 2006»
15 years 4 months ago
Grid harvest service: A performance system of grid computing
Conventional performance evaluation mechanisms focus on dedicated systems. Grid computing infrastructure, on the other hand, is a shared collaborative environment constructed on v...
Ming Wu, Xian-He Sun
135
Voted
NETWORKS
2008
15 years 4 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
TALG
2008
81views more  TALG 2008»
15 years 4 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
TIT
2008
129views more  TIT 2008»
15 years 4 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
« Prev « First page 1411 / 1625 Last » Next »