9842 search results - page 278 / 1969 » Problem complexity |
191
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
202
click to vote
ICIA
2007
15 years 9 months ago
2007
We address the problem of users creating visualizations to debug and understand multi-agent systems. The key challenges are that (1) needs arise dynamically, i.e., it is difficult...
202
click to vote
CIBB
2008
2008
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
15 years 8 months ago
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
193
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
174
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...