2446 search results - page 418 / 490 » Choiceless Polynomial Time |
AI
2005
Springer
13 years 7 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
TCOM
2008
13 years 7 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
NA
2007
13 years 7 months ago
2007
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...