14548 search results - page 306 / 2910 » The Optimal Path-Matching Problem |
183
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
185
click to vote
ICNC
2005
Springer
16 years 4 days ago
2005
Springer
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
206
click to vote
LSSC
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
216
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
167
click to vote
ATMOS
2007
15 years 8 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...