Sciweavers

13603 search results - page 68 / 2721
» On the Complexity of Computing Treelength
Sort
View
BIRTHDAY
2003
Springer
14 years 2 months ago
On the Computational Complexity of Hierarchical Radiosity
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
Robert Garmann, Heinrich Müller
FLAIRS
2003
13 years 10 months ago
On the Computational Complexity of Spatio-Temporal Logics
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
David Gabelaia, Roman Kontchakov, Agi Kurucz, Fran...
ICTCS
2003
Springer
14 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
STACS
2001
Springer
14 years 1 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
AAAI
2000
13 years 10 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm