CPAIOR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
COR
2011
12 years 11 months ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
CG
2002
Springer
13 years 4 months ago
2002
Springer
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex. We also found that some positions on the 7x7 Hex board, called trivial po...
IJCAI
2003
13 years 6 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
PIMRC
2008
IEEE
13 years 11 months ago
2008
IEEE
– In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transfor...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
PODS
2007
ACM
14 years 4 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...