1844 search results - page 289 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
117
click to vote
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
183
click to vote
ICDE
2005
IEEE
16 years 20 days ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
109
click to vote
NIPS
2007
15 years 22 days ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
100
click to vote
ICPP
2005
IEEE
15 years 4 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
EOR
2007
14 years 11 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...