Sciweavers

2745 search results - page 263 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ATAL
2010
Springer
15 years 6 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...
ICCAD
2006
IEEE
112views Hardware» more  ICCAD 2006»
16 years 1 months ago
A new RLC buffer insertion algorithm
Most existing buffering algorithms neglect the impact of inductance on circuit performance, which causes large error in circuit analysis and optimization. Even for the approaches...
Zhanyuan Jiang, Shiyan Hu, Jiang Hu, Zhuo Li, Weip...
FSTTCS
2009
Springer
15 years 11 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
SIGCOMM
2012
ACM
13 years 7 months ago
Optimizing cost and performance for content multihoming
Many large content publishers use multiple content distribution networks to deliver their content, and many industrial systems have become available to help a broader set of conte...
Hongqiang Harry Liu, Ye Wang, Yang Richard Yang, H...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 9 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor