566 search results - page 55 / 114 » Adaptive Online Program Analysis |
129
Voted
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
115
Voted
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
ITICSE
2006
ACM
15 years 8 months ago
2006
ACM
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...
AMC
2007
15 years 2 months ago
2007
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...