5084 search results - page 937 / 1017 » Proving Possibility Properties |
160
click to vote
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform classif...
128
click to vote
SCS
2003
15 years 5 months ago
2003
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
135
click to vote
MCU
1998
15 years 5 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
118
click to vote
WSC
1998
15 years 5 months ago
1998
This paper presents the analysis of the optimization for the production of precast pieces in a workshop with the help of simulation to obtain several working alternatives. The mai...
160
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...