3204 search results - page 451 / 641 » The b-chromatic Number of a Graph |
157
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
186
click to vote
AAAI
2006
15 years 8 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
189
click to vote
ICAD
2004
15 years 8 months ago
2004
Auditory Displays are quite well known in the research community, but very little of this experience is being transferred to product designers. The method of Design Patterns is we...
189
click to vote
DICTA
2003
15 years 8 months ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
162
click to vote
IJCAI
2001
15 years 8 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...