Sciweavers

467 search results - page 63 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
NETWORKING
2000
15 years 1 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
MOC
2002
135views more  MOC 2002»
14 years 11 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
MP
2010
150views more  MP 2010»
14 years 6 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 1 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
CP
2006
Springer
15 years 3 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter