Sciweavers

721 search results - page 48 / 145
» On Generators of Random Quasigroup Problems
Sort
View
AI
2008
Springer
13 years 8 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CI
2004
116views more  CI 2004»
13 years 7 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
NPL
2007
109views more  NPL 2007»
13 years 7 months ago
Generative Modeling of Autonomous Robots and their Environments using Reservoir Computing
Autonomous mobile robots form an important research topic in the field of robotics due to their near-term applicability in the real world as domestic service robots. These robots ...
Eric A. Antonelo, Benjamin Schrauwen, Jan M. Van C...
SCN
2010
Springer
145views Communications» more  SCN 2010»
13 years 6 months ago
Distributed Private-Key Generators for Identity-Based Cryptography
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
Aniket Kate, Ian Goldberg
ECAI
1994
Springer
14 years 3 days ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh