Sciweavers

1964 search results - page 232 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
IJCAI
2001
13 years 9 months ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...
ICANN
2005
Springer
14 years 1 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
ICMCS
2006
IEEE
90views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Fast Video Object Selection for Interactive Television
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
Rémi Trichet, Bernard Mérialdo
IEEECGIV
2006
IEEE
14 years 2 months ago
3D Images Compression for Multi-View Auto-Stereoscopic Displays
As auto-stereoscopic displays offer more and more different possible views, the problem of the size of the data to display is becoming more and more urging. If many 3D images com...
B. Kaufmann, M. Akil
GBRPR
2005
Springer
14 years 1 months ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon