3433 search results - page 256 / 687 » Heuristics for a bidding problem |
195
click to vote
CLUSTER
2000
IEEE
15 years 6 months ago
2000
IEEE
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
232
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Address...
233
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
190
Voted
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
191
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...