Sciweavers

3367 search results - page 172 / 674
» Incremental assignment problem
Sort
View
127
Voted
COCOA
2007
Springer
15 years 9 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 4 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
AAAI
1994
15 years 4 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
IPPS
2007
IEEE
15 years 9 months ago
A Near-optimal Solution for the Heterogeneous Multi-processor Single-level Voltage Setup Problem
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
Tai-Yi Huang, Yu-Che Tsai, Edward T.-H. Chu
140
Voted
ANOR
2004
208views more  ANOR 2004»
15 years 3 months ago
Airline Crew Rostering: Problem Types, Modeling, and Optimization
Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew p...
Niklas Kohl, Stefan E. Karisch