10568 search results - page 629 / 2114 » Computer Intelligence and Formalization |
193
click to vote
LICS
2005
IEEE
16 years 21 days ago
2005
IEEE
In the 1980s process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which...
196
click to vote
EMSOFT
2005
Springer
16 years 19 days ago
2005
Springer
systems are commonly abstracted as collections of interacting components. This perspective has lead to the insight that component behaviors can be defined separately from admissi...
230
click to vote
ICALP
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
162
click to vote
ASM
2004
ASM
16 years 16 days ago
2004
ASM
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
209
click to vote
ICDM
2003
IEEE
16 years 12 days ago
2003
IEEE
Machine learning techniques for data extraction from semistructured sources exhibit different precision and recall characteristics. However to date the formal relationship between...