133 search results - page 17 / 27 » Recognizing Mathematical Expressions Using Tree Transformati... |
175
Voted
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
113
Voted
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
106
Voted
ACSAC
2004
IEEE
15 years 6 months ago
2004
IEEE
A common way to elude a signature-based NIDS is to transform an attack instance that the NIDS recognizes into another instance that it misses. For example, to avoid matching the a...
142
Voted
JIKM
2008
15 years 2 months ago
2008
Expert systems (ESs) are complex information systems that are expensive to build and difficult to validate. Numerous knowledge representation strategies such as rules, semantic net...
129
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...