20294 search results - page 364 / 4059 » Algorithmic Information Theory |
192
click to vote
CONCUR
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
160
click to vote
AE
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class ...
192
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
171
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
190
click to vote
AAAI
2011
14 years 6 months ago
2011
Automated agents for electricity markets, social networks, and other distributed networks must repeatedly interact with other intelligent agents, often without observing associate...