3204 search results - page 632 / 641 » The Alcuin Number of a Graph |
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
102
click to vote
AAAI
2006
15 years 1 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
126
click to vote
CLIMA
2004
15 years 1 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
104
Voted
SIROCCO
2004
15 years 1 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
IJCAI
1989
15 years 1 months ago
1989
We extend qualitative reasoning with estimations of the relative likelihoods of the pos sible qualitative behaviors . We estimate the likelihoods by viewing the dynamics o f a sys...