Sciweavers

CPAIOR
2011
Springer
13 years 2 months ago
Almost Square Packing
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...
Helmut Simonis, Barry O'Sullivan
COR
2011
13 years 5 months ago
Time-constrained project scheduling with adjacent resources
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...
Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. ...
CG
2002
Springer
13 years 10 months ago
New Winning and Losing Positions for 7x7 HEx
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...
Jing Yang, Simon X. Liao, Miroslaw Pawlak
IJCAI
2003
14 years 7 days ago
On a generalization of triangulated graphs for domains decomposition of CSPs
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...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
PIMRC
2008
IEEE
14 years 5 months ago
Limited feedback for multi-antenna multi-user communications with Generalized Multi-Unitary Decomposition
– 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...
Wee Seng Chua, Chau Yuen, Yong Liang Guan, Francoi...
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 5 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— 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...
Ion Necoara, Johan A. K. Suykens
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 11 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
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...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...