254 search results - page 31 / 51 » On the randomized solution of initial value problems |
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
IJSNET
2008
13 years 8 months ago
2008
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
ACMICEC
2007
ACM
14 years 24 days ago
2007
ACM
Accurate prediction of customer preferences on products is the key to any recommender systems to realize its promised strategic values such as improved customer satisfaction and t...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...