Sciweavers

4854 search results - page 211 / 971
» It's the Programming, Stupid
Sort
View
ECRTS
2002
IEEE
16 years 4 days ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
FSTTCS
2001
Springer
15 years 11 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
CHI
2010
ACM
15 years 11 months ago
Share: a programming environment for loosely bound cooperation
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...
Yannick Assogba, Judith S. Donath
FPCA
1989
15 years 11 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...
CPAIOR
2006
Springer
15 years 11 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter