536 search results - page 67 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
JUCS
2010
13 years 7 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
FGR
2008
IEEE
14 years 3 months ago
2008
IEEE
We examine in detail some properties of gesture recognition models which utilize a reduced number of parameters and lower algorithmic complexity compared to traditional hidden Mar...
ALENEX
2010
13 years 10 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...