1532 search results - page 61 / 307 » The Symbol Grounding Problem |
135
click to vote
ICCAD
2002
IEEE
16 years 25 days ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
144
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
146
click to vote
GECCO
2008
Springer
15 years 5 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...
109
Voted
CMA
2010
15 years 1 months ago
2010
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...
171
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...