5331 search results - page 270 / 1067 » Algebraic Methods for Optimization Problems |
169
click to vote
WSC
2007
15 years 9 months ago
2007
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
181
click to vote
ISPD
2006
ACM
16 years 17 days ago
2006
ACM
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...
193
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
201
click to vote
IAT
2007
IEEE
16 years 28 days ago
2007
IEEE
In this paper, we propose a client side information management method for web services collaboration. Recently, personalization is one of the most challenging topics of the web te...
176
click to vote
ADHOC
2007
15 years 6 months ago
2007
One challenging issue in sensor networks is to determine where a given sensor node is physically located. This problem is especially crucial for very small sensor nodes. This pape...