191 search results - page 24 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
SARA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
CIAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
FLAIRS
2007
13 years 10 months ago
2007
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
P2P
2005
IEEE
14 years 1 months ago
2005
IEEE
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...