Sciweavers

1332 search results - page 73 / 267
» Combinatorial Algorithms
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
Towards a decentralized architecture for optimization
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
Marco Biazzini, Mauro Brunato, Alberto Montresor
IWANN
2007
Springer
14 years 3 months ago
Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
Brieuc Conan-Guez, Fabrice Rossi
ISCAS
2005
IEEE
149views Hardware» more  ISCAS 2005»
14 years 2 months ago
Advances in QoS path(s) selection problem
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
Krishnaiyan Thulasiraman, Ying Xiao, Guoliang Xue
SP
2000
IEEE
14 years 20 days ago
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspec...
John A. Clark, Jeremy L. Jacob
FOCS
2002
IEEE
14 years 2 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir