Sciweavers

7139 search results - page 1063 / 1428
» Language Engineering in Practice
Sort
View
FSTTCS
2004
Springer
16 years 6 days ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
ICSOC
2004
Springer
16 years 6 days ago
Methodological support for service-oriented design with ISDL
Currently, service-oriented computing is mainly technology-driven. Most developments focus on the technology that enables enterprises to describe, publish and compose application ...
Dick A. C. Quartel, Remco M. Dijkman, Marten van S...
SEKE
2004
Springer
16 years 5 days ago
Grammatically Interpreting Feature Compositions
Feature modeling is a popular domain analysis method for describing the commonality and variability among the domain products. The current formalisms of feature modelling do not ha...
Wei Zhao, Barrett R. Bryant, Fei Cao, Rajeev R. Ra...
APLAS
2003
ACM
16 years 2 days ago
A Typeful and Tagless Representation for XML Documents
When constructing programs to process XML documents, we immediately face the question as to how XML documents should be represented internally in the programming language we use. C...
Dengping Zhu, Hongwei Xi
KCAP
2003
ACM
16 years 2 days ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
« Prev « First page 1063 / 1428 Last » Next »