9842 search results - page 197 / 1969 » Problem complexity |
104
click to vote
CC
2006
Springer
15 years 2 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
117
click to vote
CN
2004
15 years 2 months ago
2004
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
108
click to vote
LATIN
1998
Springer
15 years 6 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
AI
2005
Springer
15 years 2 months ago
2005
Springer
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
128
click to vote
DAGSTUHL
1997
15 years 3 months ago
1997
Analyzing structure in complex time dependent flow fields is a challenging problem. This paper describes the use of spot noise for the visualization of this type of fields. Spo...