9949 search results - page 372 / 1990 » On the Network Complexity of Selection |
153
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
199
click to vote
PODC
2006
ACM
16 years 24 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
193
click to vote
GRID
2000
Springer
15 years 10 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
225
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
186
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The integration of many aspects of protein/DNA structure analysis is an important requirement for software products in general area of structural bioinformatics. In fa...