1404 search results - page 97 / 281 » Optimization problems in multiple-interval graphs |
111
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
AUTOMATICA
2008
14 years 10 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
100
click to vote
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
105
click to vote
JGAA
2007
14 years 10 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...