Sciweavers

5595 search results - page 291 / 1119
» Comparing Subsumption Optimizations
Sort
View
CCE
2004
15 years 6 months ago
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches...
Diego C. Cafaro, Jaime Cerdá
JOCN
2010
70views more  JOCN 2010»
15 years 5 months ago
Optimizing Design Efficiency of Free Recall Events for fMRI
■ Free recall is a fundamental paradigm for studying memory retrieval in the context of minimal cue support. Accordingly, free recall has been extensively studied using behavior...
Ilke Öztekin, Nicole M. Long, David Badre
ICA
2004
Springer
16 years 1 days ago
Approximate Joint Diagonalization Using a Natural Gradient Approach
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
Arie Yeredor, Andreas Ziehe, Klaus-Robert Mül...
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 4 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
LION
2007
Springer
100views Optimization» more  LION 2007»
16 years 24 days ago
Nested Partitioning for the Minimum Energy Broadcast Problem
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
Sameh Al-Shihabi, Peter Merz, Steffen Wolf