8825 search results - page 199 / 1765 » All for one or one for all |
97
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
A method is presented that allows one to exactly determine all the characteristics of a PSO’s sampling distribution and explain how it changes over time, in the presence stochas...
102
click to vote
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
WG
2007
Springer
15 years 7 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
WINE
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we study competitive markets - a market is competitive if increasing the endowment of any one buyer does not increase the equilibrium utility of any other buyer. In ...
113
click to vote
WOLLIC
2007
Springer
15 years 7 months ago
2007
Springer
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...