Sciweavers

1725 search results - page 283 / 345
» Relaxed genetic programming
Sort
View
EUROPAR
2000
Springer
15 years 1 months ago
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
David S. Wise
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
IPCO
2010
148views Optimization» more  IPCO 2010»
14 years 11 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
IPCO
2008
163views Optimization» more  IPCO 2008»
14 years 11 months ago
The Air Traffic Flow Management Problem: An Integer Optimization Approach
In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases o...
Dimitris Bertsimas, Guglielmo Lulli, Amedeo R. Odo...
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
14 years 11 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...