4403 search results - page 416 / 881 » Galois Theory of Algorithms |
175
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...
155
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
183
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
172
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
217
click to vote
VTC
2007
IEEE
16 years 1 months ago
2007
IEEE
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...