Sciweavers

1948 search results - page 339 / 390
» Formalizing Mirror Theory
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 10 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
SIGCSE
2008
ACM
171views Education» more  SIGCSE 2008»
13 years 9 months ago
Contributing student pedagogy
A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal educat...
John Hamer, Quintin I. Cutts, Jana Jacková,...
PLDI
2011
ACM
13 years 23 days ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
SIGIR
2012
ACM
12 years 11 days ago
Explicit relevance models in intent-oriented information retrieval diversification
The intent-oriented search diversification methods developed in the field so far tend to build on generative views of the retrieval system to be diversified. Core algorithm compon...
Saul Vargas, Pablo Castells, David Vallet
TEC
2012
195views Formal Methods» more  TEC 2012»
12 years 10 days ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López