Sciweavers

14386 search results - page 32 / 2878
» The Chinese Generals Problem
Sort
View
COR
2007
97views more  COR 2007»
15 years 1 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang
107
Voted
ATAL
2006
Springer
15 years 5 months ago
An agent based general solution model for the course timetabling problem
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
Yan Yang, Raman Paranjape, Luigi Benedicenti
168
Voted
CVPR
2009
IEEE
16 years 9 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
92
Voted
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
15 years 3 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
COR
2010
150views more  COR 2010»
15 years 2 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...