Sciweavers

1452 search results - page 130 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
96
Voted
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 16 days ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
155
Voted
POPL
2003
ACM
16 years 26 days ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
88
Voted
ISSTA
2009
ACM
15 years 7 months ago
Time-aware test-case prioritization using integer linear programming
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
Lu Zhang, Shan-Shan Hou, Chao Guo, Tao Xie, Hong M...
128
Voted
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 4 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
INFOVIS
2003
IEEE
15 years 5 months ago
BARD: A visualization tool for biological sequence analysis
We present BARD (biological arc diagrams), a visualization tool for biological sequence analysis. The development of BARD began with the application of Wattenberg’s arc diagrams...
Rhazes Spell, Rachael Brady, Fred Dietrich