16504 search results - page 384 / 3301 » New Problems, New Solutions |
193
click to vote
PPOPP
2005
ACM
16 years 12 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
177
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
188
click to vote
EOR
2007
15 years 6 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
155
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
168
click to vote
ATAL
2003
Springer
16 years 2 days ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...