Sciweavers

6274 search results - page 1020 / 1255
» From query complexity to computational complexity
Sort
View
167
Voted
AIED
2009
Springer
16 years 26 days ago
Discovering Tutorial Dialogue Strategies with Hidden Markov Models
Identifying effective tutorial strategies is a key problem for tutorial dialogue systems research. Ongoing work in human-human tutorial dialogue continues to reveal the complex phe...
Kristy Elizabeth Boyer, Eunyoung Ha, Michael D. Wa...
CSEE
2009
Springer
16 years 25 days ago
Software Engineering Education for Bioinformatics
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material...
Medha Umarji, Carolyn B. Seaman, Akif Günes K...
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
16 years 25 days ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...
FMCAD
2009
Springer
16 years 25 days ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
FSTTCS
2009
Springer
16 years 25 days ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
« Prev « First page 1020 / 1255 Last » Next »