Sciweavers

2814 search results - page 53 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
14 years 3 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
ICCV
2009
IEEE
13 years 7 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
CORR
2006
Springer
136views Education» more  CORR 2006»
13 years 10 months ago
Bargaining over the interference channel
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
Amir Leshem, Ephraim Zehavi
DMIN
2006
126views Data Mining» more  DMIN 2006»
13 years 11 months ago
Comparison and Analysis of Mutation-based Evolutionary Algorithms for ANN Parameters Optimization
Mutation-based Evolutionary Algorithms, also known as Evolutionary Programming (EP) are commonly applied to Artificial Neural Networks (ANN) parameters optimization. This paper pre...
Kristina Davoian, Alexander Reichel, Wolfram-Manfr...
JCPHY
2011
192views more  JCPHY 2011»
13 years 24 days ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer