Sciweavers

597 search results - page 28 / 120
» New Algorithms for Improved Transcendental Functions on IA-6...
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
COCO
2003
Springer
91views Algorithms» more  COCO 2003»
14 years 1 months ago
Extremal properties of polynomial threshold functions
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
Ryan O'Donnell, Rocco A. Servedio
INFOCOM
1999
IEEE
14 years 23 days ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 2 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
ATAL
2008
Springer
13 years 10 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis