Sciweavers

1486 search results - page 176 / 298
» Algorithms for two-box covering
Sort
View
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
15 years 10 months ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles
GECCO
2007
Springer
129views Optimization» more  GECCO 2007»
15 years 10 months ago
Procreating V-detectors for nonself recognition: an application to anomaly detection in power systems
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
Min Gui, Sanjoy Das, Anil Pahwa
PODC
2005
ACM
15 years 10 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
CAV
2005
Springer
104views Hardware» more  CAV 2005»
15 years 10 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
CP
2003
Springer
15 years 9 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano