3946 search results - page 327 / 790 » The computational complexity of choice sets |
176
click to vote
PPSN
1994
Springer
15 years 11 months ago
1994
Springer
A general model for the coevolution of cooperating species is presented. This model is instantiated and tested in the domain of function optimization, and compared with a tradition...
169
click to vote
AB
2007
Springer
15 years 10 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
155
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
189
click to vote
WOA
2001
15 years 8 months ago
2001
Abstract--In the network-centric computing era, applications often involve sets of autonomous, unpredictable, and possibly mobile entities interacting within open, dynamic, and pos...
179
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...