2125 search results - page 251 / 425 » On Graph Complexity |
154
click to vote
AI
2007
Springer
15 years 9 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...
125
click to vote
CASC
2007
Springer
15 years 9 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. ...
153
click to vote
DATE
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
115
click to vote
HYBRID
2007
Springer
15 years 7 months ago
2007
Springer
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
128
click to vote
JCDCG
2000
Springer
15 years 6 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...