Sciweavers

1542 search results - page 35 / 309
» Kernelization of packing problems
Sort
View
118
Voted
EVOW
2009
Springer
15 years 9 months ago
A Tabu Search Algorithm with Direct Representation for Strip Packing
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao
AIPS
2006
15 years 3 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
122
Voted
CVPR
2007
IEEE
16 years 4 months ago
Connecting the Out-of-Sample and Pre-Image Problems in Kernel Methods
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
Pablo Arias, Gregory Randall, Guillermo Sapiro
111
Voted
ICML
2008
IEEE
16 years 3 months ago
Active kernel learning
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A variety of kernel learning algorithms have been prop...
Steven C. H. Hoi, Rong Jin
CPAIOR
2009
Springer
15 years 9 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin