158 search results - page 8 / 32 » Local search for distributed asymmetric optimization |
127
click to vote
CPHYSICS
2006
15 years 1 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
131
click to vote
PPSN
2010
Springer
15 years 5 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
113
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
124
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
111
Voted
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...