Sciweavers

334 search results - page 47 / 67
» A New Parallel Algorithm for Generalized LR Parsing
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 3 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 4 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
ECCV
2008
Springer
16 years 1 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
CHES
2009
Springer
157views Cryptology» more  CHES 2009»
16 years 8 days ago
Differential Cluster Analysis
Abstract. We propose a new technique called Differential Cluster Analysis for side-channel key recovery attacks. This technique uses cluster analysis to detect internal collisions ...
Lejla Batina, Benedikt Gierlichs, Kerstin Lemke-Ru...