Sciweavers

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

71

Voted

MOR
2007

77views more MOR 2007»

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

15 years 2 months ago

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

Download www.math.unipd.it

Michele Conforti, Marco Di Summa, Giacomo Zambelli

Real-time Traffic

MOR 2007 |

claim paper

Related Content

» ThermalAware SoC Test Scheduling with Test Set Partitioning and Interleaving

» Psychoacoustically Constrained and Distortion Minimized Speech Enhancement

» A new heuristicbased albeit complete method to extract MUCs from unsatisfiable CSPs

» On Finding All Minimally Unsatisfiable Subformulas

» Flow Graph Balancing for Minimizing the Required Memory Bandwidth

» Handling Constraints in MultiObjective GA for Embedded System Design

» Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balan...

» The Power Balancing Problem in Energy Constrained MultiHop Wireless Networks

» JetStream Probabilistic Contour Extraction with Particles

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MOR
Authors	Michele Conforti, Marco Di Summa, Giacomo Zambelli

Comments (0)