Sciweavers

1647 search results - page 239 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
INFOCOM
2010
IEEE
15 years 23 days ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
15 years 9 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
ECCV
2010
Springer
15 years 7 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 4 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 6 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