Sciweavers

1110 search results - page 72 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
CEC
2010
IEEE
14 years 11 months ago
A penalty-based genetic algorithm for the composite SaaS placement problem in the Cloud
— Cloud computing is a latest new computing paradigm where applications, data and IT services are provided over the Internet. Cloud computing has become a main medium for Softwar...
Zeratul Izzah Mohd Yusoh, Maolin Tang
AAAI
2006
15 years 19 days ago
Improving Approximate Value Iteration Using Memories and Predictive State Representations
Planning in partially-observable dynamical systems is a challenging problem, and recent developments in point-based techniques such as Perseus significantly improve performance as...
Michael R. James, Ton Wessling, Nikos A. Vlassis
DAM
2008
111views more  DAM 2008»
14 years 11 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
IPPS
2006
IEEE
15 years 5 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
CEEMAS
2005
Springer
15 years 4 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim