Sciweavers

13621 search results - page 20 / 2725
» Computability and Complexity in Self-assembly
Sort
View
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 3 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
CSCWD
2008
Springer
13 years 11 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 9 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
CHI
2007
ACM
14 years 10 months ago
Computer aided observations of complex mobile situations
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
Tobias Klug
COMGEO
2010
ACM
13 years 10 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...