Sciweavers

1855 search results - page 228 / 371
» A coding theorem for distributed computation
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ICDCSW
2003
IEEE
15 years 9 months ago
Toward a Security Architecture for Smart Messages: Challenges, Solutions, and Open Issues
Smart Messages (SMs) are migratory execution units used to describe distributed computations over mobile ad hoc networks of embedded systems. The main benefits provided by SMs ar...
Gang Xu, Cristian Borcea, Liviu Iftode
CCGRID
2006
IEEE
15 years 7 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
VECPAR
2000
Springer
15 years 7 months ago
Improving the Performance of Heterogeneous DSMs via Multithreading
This paper analyzes the impact of hardware multithreading support on the performance of distributed shared-memory DSM multiprocessors built out of heterogeneous, single-chip compu...
Renato J. O. Figueiredo, Jeffrey P. Bradford, Jos&...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 10 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio