2612 search results - page 510 / 523 » Switching Graphs and Their Complexity |
90
Voted
CCCG
2008
14 years 11 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
81
Voted
SIROCCO
2010
14 years 11 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 ...
164
click to vote
SYRCODIS
2008
14 years 11 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
AAAI
2006
14 years 11 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...
105
click to vote
CLIMA
2004
14 years 11 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)...