7930 search results - page 51 / 1586 » Greedy in Approximation Algorithms |
140
Voted
AAAI
2011
14 years 2 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
157
Voted
ICDE
2011
IEEE
14 years 6 months ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
120
click to vote
WWW
2011
ACM
14 years 9 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
135
click to vote
PCI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
112
click to vote
ESANN
2003
15 years 3 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...