5100 search results - page 556 / 1020 » The Linear Complexity of a Graph |
272
click to vote
Publication
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
210
Voted
AI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
188
click to vote
CASC
2007
Springer
16 years 1 months ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
146
click to vote
ICRA
2006
IEEE
16 years 27 days ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
189
click to vote
STOC
2006
ACM
16 years 24 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...