46 search results - page 8 / 10 » Applying Local Search to Temporal Reasoning |
BMCBI
2008
13 years 7 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
EWCBR
2006
Springer
13 years 11 months ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
AAAI
2000
13 years 9 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
AIPS
2006
13 years 9 months ago
2006
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 ...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper we proposed a video signature based on ordinal measure of resampled video frames, which is robust to changing compression formats, compression ratios, frame sizes an...