Sciweavers

1007 search results - page 67 / 202
» The Complexity of Futile Questioning
Sort
View
CEC
2010
IEEE
14 years 7 months ago
Tweaking a tower of blocks leads to a TMBL: Pursuing long term fitness growth in program evolution
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
Tony E. Lewis, George D. Magoulas
IJKSR
2011
106views more  IJKSR 2011»
14 years 7 months ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
165
Voted
CORR
2012
Springer
214views Education» more  CORR 2012»
13 years 11 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
SIGMOD
2012
ACM
222views Database» more  SIGMOD 2012»
13 years 6 months ago
Tiresias: a demonstration of how-to queries
In this demo, we will present Tiresias, the first how-to query engine. How-to queries represent fundamental data analysis questions of the form: “How should the input change in...
Alexandra Meliou, Yisong Song, Dan Suciu
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 6 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko