3353 search results - page 469 / 671 » Laver and set theory |
171
click to vote
CSL
2004
Springer
15 years 12 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
188
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
176
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
148
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
158
click to vote
DESRIST
2009
Springer
15 years 11 months ago
2009
Springer
The paper elaborates on the theoretical foundation of Information System understood as a field of design science. Revisiting Hevner’s et al. seminal paper [44], we elaborate on ...