4047 search results - page 122 / 810 » Some Properties and Some Problems on Set Functors |
148
Voted
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
159
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
155
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
129
click to vote
INFORMATICALT
2002
15 years 4 months ago
2002
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
141
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...