1844 search results - page 58 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
102
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
ICIP
2005
IEEE
16 years 27 days ago
2005
IEEE
Distributed source coding (DSC) depends strongly on accurate knowledge of correlation between sources. Previous works have reported capacity-approaching code constructions when ex...
ICNC
2005
Springer
15 years 4 months ago
2005
Springer
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
103
click to vote
GIS
2007
ACM
15 years 3 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...