Sciweavers

10935 search results - page 1914 / 2187
» Neural Programming Language
Sort
View
CEC
2010
IEEE
15 years 3 months ago
Tree-adjunct grammatical evolution
In this paper we investigate the application of tree-adjunct grammars to grammatical evolution. The standard type of grammar used by grammatical evolution, context-free grammars, p...
Eoin Murphy, Michael O'Neill, Edgar Galván ...
ATAL
2010
Springer
15 years 2 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
BIRTHDAY
2010
Springer
15 years 2 months ago
Model Checking Programmable Router Configurations
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
Luca Zanolin, Cecilia Mascolo, Wolfgang Emmerich
APAL
2008
90views more  APAL 2008»
15 years 2 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 2 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
« Prev « First page 1914 / 2187 Last » Next »