Sciweavers

1236 search results - page 51 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
ARCS
2005
Springer
15 years 3 months ago
Towards Autonomic Networking Using Overlay Routing Techniques
With an ever-growing number of computers being embedded into our surroundings, the era of ubiquitous computing is approaching fast. However, as the number of networked devices incr...
Kendy Kutzner, Curt Cramer, Thomas Fuhrmann
NIPS
2000
14 years 11 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
UC
2010
Springer
14 years 7 months ago
Characterising Enzymes for Information Processing: Towards an Artificial Experimenter
The information processing capabilities of many proteins are currently unexplored. The complexities and high dimensional parameter spaces make their investigation impractical. Diff...
Chris Lovell, Gareth Jones, Steve R. Gunn, Klaus-P...
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 9 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
TC
2008
14 years 9 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park