1139 search results - page 131 / 228 » Bounded Ideation Theory |
153
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
157
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
134
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
178
click to vote
DALT
2005
Springer
15 years 10 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
129
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...