Sciweavers

2303 search results - page 336 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
ESCIENCE
2006
IEEE
15 years 11 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus
FCCM
2006
IEEE
106views VLSI» more  FCCM 2006»
15 years 11 months ago
Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
Abstract— This paper introduces a novel architecture for performing the core computations required by dynamic programming (DP) techniques. The latter pertain to a vast range of a...
Brad Matthews, Itamar Elhanany
ICDCSW
2006
IEEE
15 years 11 months ago
Network-Aware Overlays with Network Coordinates
Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates...
Peter R. Pietzuch, Jonathan Ledlie, Michael Mitzen...
ICDCSW
2006
IEEE
15 years 11 months ago
Dealing with Class Skew in Context Recognition
As research in context recognition moves towards more maturity and real life applications, appropriate and reliable performance metrics gain importance. This paper focuses on the ...
Mathias Stäger, Paul Lukowicz, Gerhard Tr&oum...
CCGRID
2005
IEEE
15 years 10 months ago
Object-oriented SPMD
— This article presents an evolution of classical SPMD programming for clusters and grids. It is named ”Object-Oriented SPMD” as it is based on remote method invocation. More...
Laurent Baduel, Françoise Baude, Denis Caro...