1220 search results - page 86 / 244 » Restricting grammatical complexity |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
CGF
2007
13 years 7 months ago
2007
We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restri...
ML
2008
ACM
13 years 7 months ago
2008
ACM
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types. Existing approaches require dynamic checks or more...
TEC
2008
13 years 7 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
JC
2007
13 years 7 months ago
2007
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...