Sciweavers

3136 search results - page 409 / 628
» Genetic programming theory
Sort
View
AIM
2006
15 years 8 months ago
Increasing the benefit of analysis: The case of systems that support communication
: Researchers in academia and practitioners in the field are concluding that object orientation (OO) supports well the stages of technical design and programming but not the stages...
Dov Te'eni, Roy Gelbard, Matti Sade
ACL
1997
15 years 7 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
COLING
1994
15 years 7 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
EOR
2008
136views more  EOR 2008»
15 years 6 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 4 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel