We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
An increasing, degree of rich and dynamic content and abundant links are making Web pages visually cluttered. This paper presents a numerical tool to evaluate the screen complexity...
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
We argue that socio-technical systems can be understood as complex adaptive systems, that is, systems containing component sub-systems interacting such that they co-evolve This vie...