Sciweavers

3937 search results - page 158 / 788
» Questioning Ubiquitous Computing
Sort
View
COCOON
2003
Springer
15 years 11 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
HICSS
2002
IEEE
138views Biometrics» more  HICSS 2002»
15 years 11 months ago
Artificial Computer-Assisted International Negotiation: A Tool for Research and Practice
We propose a web-based computer-assisted tool for diagnosing progress in international negotiation. The system is based on a general linear model. Innovative features of the progr...
Daniel Druckman, Richard Harris, Bennett Ramberg
BSL
2008
97views more  BSL 2008»
15 years 6 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
JSC
2002
68views more  JSC 2002»
15 years 6 months ago
Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups
, Allen C.) see Innovations in teaching abstract algebra, 2003b:00019 Littlewood, D. E. The skeleton key of mathematics. (English summary) 2003j:01046 Magnin, Louis Quelques questi...
Bettina Eick
MIDDLEWARE
2007
Springer
16 years 16 days ago
Domain-based context management for dynamic and evolutionary environments
Research in context-aware computing has produced a number of application prototypes, frameworks, middlewares and models for describing context. However, development of ubiquitous ...
Ricardo Couto Antunes da Rocha, Markus Endler