Sciweavers

1569 search results - page 117 / 314
» Programming contest strategy
Sort
View
TACS
1994
Springer
15 years 4 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
98
Voted
AIEDU
2007
108views more  AIEDU 2007»
15 years 20 days ago
Explicit Reflection in Prolog-Tutor
This paper describes a reflection-based approach for open learner modeling (OLM). Tutoring dialogues are used by learners to explicitly reveal their own knowledge state to themselv...
Joséphine M. P. Tchétagni, Roger Nka...
81
Voted
BMCBI
2008
111views more  BMCBI 2008»
15 years 19 days ago
GENOMEPOP: A program to simulate genomes in populations
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
Antonio Carvajal-Rodríguez
109
Voted
CAV
2007
Springer
166views Hardware» more  CAV 2007»
15 years 6 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...
136
Voted
CPAIOR
2007
Springer
15 years 6 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker