Sciweavers

1597 search results - page 171 / 320
» A Design Method for Object-Oriented Programming
Sort
View
PADO
2001
Springer
15 years 7 months ago
Deriving Pre-conditions for Array Bound Check Elimination
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
ACMIDC
2009
15 years 6 months ago
Simple tangible language elements for young children
We propose simple tangible language elements for very young children to use when constructing programmes. The equivalent Turtle Talk instructions are given for comparison. Two exa...
Andrew Cyrus Smith
128
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 3 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
AMAI
2002
Springer
15 years 3 months ago
Generalizations of Watched Literals for Backtracking Search
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
Allen Van Gelder
TOG
2010
157views more  TOG 2010»
14 years 10 months ago
Computer-generated residential building layouts
We present a method for automated generation of building layouts for computer graphics applications. Our approach is motivated by the layout design process developed in architectu...
Paul Merrell, Eric Schkufza, Vladlen Koltun