2308 search results - page 180 / 462 » Representing Symbolic Reasoning |
171
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
179
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
202
click to vote
STEP
2005
IEEE
16 years 2 days ago
2005
IEEE
The decomposition of design patterns into simpler elements may reduce significantly the creation of variants in forward engineering, while it increases the possibility of identify...
160
click to vote
MDM
2004
Springer
15 years 12 months ago
2004
Springer
Location-based applications require a well-formed representation of spatial knowledge. Current location models can be classified into symbolic or geometric models. The former att...
164
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...