3008 search results - page 322 / 602 » Independence in connected graphs |
173
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
162
click to vote
IPPS
2003
IEEE
16 years 1 days ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
186
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
180
click to vote
JCP
2006
15 years 6 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
195
click to vote
FCS
2009
15 years 4 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...