Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CP
2003
Springer

favoriteEmaildiscussreport

80views Artificial Intelligence» more CP 2003»

Semi-independent Partitioning: A Method for Bounding the Solution to COP's

13 years 10 months ago

Semi-independent Partitioning: A Method for Bounding the Solution to COP's

Download www.ics.uci.edu

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 generalization of the mini buckets algorithm [1]. We demonstrate empirically that another specialization of SIP, called greedy SIP, generally produces a better answer than mini buckets in much less time.

David Larkin

Real-time Traffic

CP 2003 | Greedy Sip | Mini Buckets | Programming Languages | Semi-independent Partitioning |

claim paper

Related Content

» Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem

» Discounted MEAN bound for the optimal searcher path problem with nonuniform travel times

» StatisticalBased Approach to Word Segmentation

» Spectral Relaxation for Kmeans Clustering

» Postplacement voltage island generation

» Communities Detection in Large Networks

» Enzymatic target identification with dynamic states

» Constraint Prioritization for Efficient Analysis of Declarative Models

» Optimality and Complexity of Pure Nash Equilibria in the Coverage Game

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CP
Authors	David Larkin

Comments (0)