100 search results - page 15 / 20 » Upper Bounds for Vertex Cover Further Improved |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
OSN
2007
13 years 6 months ago
2007
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
TOCL
2008
13 years 7 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...