5153 search results - page 395 / 1031 » Introduction to Randomized Algorithms |
150
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
135
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
138
Voted
ESA
1998
Springer
15 years 9 months ago
1998
Springer
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
159
Voted
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
142
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...