Sciweavers

32 search results - page 6 / 7
» Persuasive, Authorative and Topical Answers for Complex Ques...
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
CHI
2009
ACM
13 years 10 months ago
A comparison of mobile money-transfer UIs for non-literate and semi-literate users
Due to the increasing penetration of mobile phones even into poor communities, mobile payment schemes could bring formal financial services to the "unbanked". However, b...
Indrani Medhi, S. N. Nagasena Gautama, Kentaro Toy...
UC
2009
Springer
14 years 17 days ago
Brain Dynamics Promotes Function
Abstract. Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states....
Carlos Lourenço
STACS
2010
Springer
14 years 1 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 11 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust