312 search results - page 15 / 63 » On k-optimal distributed constraint optimization algorithms:... |
NIPS
2007
13 years 10 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
AMC
2007
13 years 9 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
EMO
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...
CORR
2009
Springer
13 years 6 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
CP
2003
Springer
14 years 2 months ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...