Sciweavers

2693 search results - page 20 / 539
» On Computing Complex Navigation Functions
Sort
View
SPDP
1990
IEEE
14 years 1 months ago
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Akhilesh Tyagi, John H. Reif
LICS
2008
IEEE
14 years 4 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
IJAC
2007
73views more  IJAC 2007»
13 years 9 months ago
Computationally and Algebraically Complex Finite Algebra Membership Problems
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
Marcin Kozik
ICSOFT
2008
13 years 11 months ago
An Architecture for Non Functional Properties Management in Distributed Computing
One of the primary benefits of Service Oriented Architecture (SOA) [1] is the ability to compose applications, processes or more complex services from other services. As the comple...
Pierre de Leusse, Panos Periorellis, Theodosis Dim...
DSVIS
2008
Springer
13 years 11 months ago
Comparing Mixed Interactive Systems for Navigating 3D Environments in Museums
This work aims at developing appropriate Mixed Interaction Systems (MIS) for navigating 3D environments in a science centre context. Due to the wide range and multi-disciplinary de...
Emmanuel Dubois, Cédric Bach, Philippe Trui...