Sciweavers

4266 search results - page 541 / 854
» The container loading problem
Sort
View
IJCAI
2007
15 years 4 months ago
Learning to Identify Unexpected Instances in the Test Set
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
Xiaoli Li, Bing Liu, See-Kiong Ng
112
Voted
IJCAI
2007
15 years 4 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
113
Voted
IJCAI
2007
15 years 4 months ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
106
Voted
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 4 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 4 months ago
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong