Sciweavers

4342 search results - page 606 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
GECCO
2007
Springer
269views Optimization» more  GECCO 2007»
15 years 11 months ago
Automated red teaming: a proposed framework for military application
In this paper, we describe Automated Red Teaming (ART), a concept that uses Evolutionary Algorithm (EA), Parallel Computing and Simulation to complement the manual Red Teaming eff...
Chwee Seng Choo, Ching Lian Chua, Su-Han Victor Ta...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
15 years 11 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
15 years 11 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong
FOCS
1997
IEEE
15 years 9 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 7 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan