Sciweavers

1055 search results - page 70 / 211
» Enumerations in computable structure theory
Sort
View
IADIS
2004
14 years 11 months ago
Selecting Multimedia Interactions to Build Knowledge Structures
Two sets of multimedia learning materials were compared for their ability to promote learning of introductory computer programming The first set of materials was a sequentially na...
Wendy Doube, Juhani Tuovinen, Dale Shaffer
NJC
2006
86views more  NJC 2006»
14 years 9 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 2 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 4 months ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto