2612 search results - page 329 / 523 » Switching Graphs and Their Complexity |
168
Voted
AI
2007
Springer
15 years 10 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...
141
Voted
CASC
2007
Springer
15 years 10 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. ...
116
click to vote
ICRA
2006
IEEE
15 years 10 months 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...
138
click to vote
STOC
2006
ACM
15 years 10 months 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...
132
click to vote
COORDINATION
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...