Sciweavers

8647 search results - page 506 / 1730
» The Container Selection Problem
Sort
View
168
Voted
ICALP
2010
Springer
15 years 8 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
165
Voted
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 7 months ago
Adapted Pittsburgh classifier system: building accurate strategies in non markovian environments
This paper focuses on the study of the behavior of a genetic algorithm based classifier system, the Adapted Pittsburgh Classifier System (A.P.C.S), on maze type environments con...
Gilles Énée, Mathias Péroumal...
CVPR
2010
IEEE
15 years 6 months ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...
JAIR
2000
102views more  JAIR 2000»
15 years 6 months ago
A Model of Inductive Bias Learning
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem bein...
Jonathan Baxter
PVLDB
2010
195views more  PVLDB 2010»
15 years 4 months ago
Keyword++: A Framework to Improve Keyword Search Over Entity Databases
Keyword search over entity databases (e.g., product, movie databases) is an important problem. Current techniques for keyword search on databases may often return incomplete and i...
Dong Xin, Yeye He, Venkatesh Ganti