Sciweavers

1948 search results - page 232 / 390
» Formalizing Mirror Theory
Sort
View
IJON
2006
161views more  IJON 2006»
15 years 6 months ago
Evolving hybrid ensembles of learning machines for better generalisation
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
Arjun Chandra, Xin Yao
DAM
2007
85views more  DAM 2007»
15 years 6 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
JTAER
2008
80views more  JTAER 2008»
15 years 6 months ago
Web 2.0 as Syndication
There is considerable excitement about the notion of 'Web 2.0', particularly among Internet businesspeople. In contrast, there is an almost complete lack of formal liter...
Roger Clarke
ENTCS
2007
144views more  ENTCS 2007»
15 years 6 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
FUIN
2007
110views more  FUIN 2007»
15 years 6 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor