Sciweavers

20 search results - page 3 / 4
» A Grammar-based Approach to Invertible Programs
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
ERSHOV
2003
Springer
15 years 2 months ago
The Outside-In Method of Teaching Introductory Programming
The new design for the introductory programming course at ETH relies on object technology, Eiffel, extensive reuse, a graphics-rich library (TRAFFIC) built specifically for the c...
Bertrand Meyer
KBSE
2005
IEEE
15 years 3 months ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power
CPP
2011
107views more  CPP 2011»
13 years 9 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood