Sciweavers

824 search results - page 10 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
APPML
2007
92views more  APPML 2007»
13 years 8 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
HASE
2008
IEEE
14 years 2 months ago
A Grammar-Based Reverse Engineering Framework for Behavior Verification
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
Chunying Zhao, Kang Zhang
LPAR
2001
Springer
14 years 26 days ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 2 months ago
An analysis of constructive crossover and selection pressure in genetic programming
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
Huayang Xie, Mengjie Zhang, Peter Andreae