Sciweavers

16844 search results - page 53 / 3369
» How to Design Programs
Sort
View
CPAIOR
2007
Springer
15 years 8 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
ICSE
2001
IEEE-ACM
15 years 7 months ago
Designing Components Versus Objects: A Transformational Approach
A good object-oriented design does not necessarily make a good component-based design, and vice versa. What design principles do components introduce? This paper examines componen...
David H. Lorenz, John M. Vlissides
HIS
2007
15 years 4 months ago
Genetic Programming meets Model-Driven Development
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...
Thomas Weise, Michael Zapf, Mohammad Ullah Khan, K...
115
Voted
GPCE
2005
Springer
15 years 8 months ago
A Generative Programming Approach to Interactive Information Retrieval: Insights and Experiences
We describe the application of generative programming to a problem in interactive information retrieval. The particular interactive information retrieval problem we study is the su...
Saverio Perugini, Naren Ramakrishnan
OOPSLA
1999
Springer
15 years 6 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard