Sciweavers

15485 search results - page 54 / 3097
» Computing Optimal Subsets
Sort
View
76
Voted
GECCO
2008
Springer
15 years 3 months ago
An asynchronous hybrid genetic-simplex search for modeling the Milky Way galaxy using volunteer computing
Travis J. Desell, Boleslaw K. Szymanski, Carlos A....
107
Voted
PE
2008
Springer
94views Optimization» more  PE 2008»
15 years 2 months ago
A class of mean field interaction models for computer and communication systems
Michel Benaïm, Jean-Yves Le Boudec
107
Voted
ATMOS
2010
108views Optimization» more  ATMOS 2010»
15 years 1 months ago
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
Robert Geisberger, Peter Sanders
119
Voted
RSA
2011
131views more  RSA 2011»
14 years 8 months ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...
103
Voted
LICS
2007
IEEE
15 years 8 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat