Sciweavers

44 search results - page 5 / 9
» The logarithmic hypervolume indicator
Sort
View
INFOCOM
2007
IEEE
14 years 5 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
FS
2006
135views more  FS 2006»
13 years 11 months ago
Asymmetric Information in Fads Models
Fads models were introduced by Shiller (1984) and Summers (1986) as plausible alternatives to the efficient markets/constant expected returns assumptions. Under these models, loga...
Paolo Guasoni
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 3 months ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
CP
2009
Springer
14 years 11 months ago
Evaluation of Length-Lex Set Variables
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
Justin Yip, Pascal Van Hentenryck
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
14 years 5 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost