406 search results - page 78 / 82 » Pseudorandomness and Combinatorial Constructions |
127
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
149
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
FDTC
2009
Springer
15 years 7 months ago
2009
Springer
—In order to protect crypto-systems against side channel attacks various countermeasures have been implemented such as dual-rail logic or masking. Faults attacks are a powerful t...
92
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
107
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...