Sciweavers

5090 search results - page 89 / 1018
» Constructing Strategies for Programming
Sort
View
ICLP
1990
Springer
14 years 1 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
CATS
2007
13 years 10 months ago
Constructing Strictly Positive Families
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
Peter Morris, Thorsten Altenkirch, Neil Ghani
CJ
2010
190views more  CJ 2010»
13 years 6 months ago
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory
A concurrent object is an object that can be concurrently accessed by several processes. Sequential consistency is a consistency criterion for such objects. Informally, it states ...
Vicent Cholvi, Antonio Fernández, Ernesto J...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 3 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
AAAI
2004
13 years 10 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...