Sciweavers

311 search results - page 22 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 2 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
ISPD
2003
ACM
171views Hardware» more  ISPD 2003»
14 years 27 days ago
Timing driven force directed placement with physical net constraints
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tu...
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
13 years 7 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
INFOCOM
2012
IEEE
11 years 10 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson