Sciweavers

519 search results - page 12 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
COCOON
2008
Springer
15 years 3 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le
ICASSP
2011
IEEE
14 years 5 months ago
Mixed-integer linear programming framework for max-min power control with single-stage interference cancellation
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
Eleftherios Karipidis, Di Yuan, Erik G. Larsson
CP
2005
Springer
15 years 3 months ago
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
Hariolf Betz, Thom W. Frühwirth
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 7 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ICA
2004
Springer
15 years 6 months ago
Blind Maximum Likelihood Separation of a Linear-Quadratic Mixture
Abstract. We proposed recently a new method for separating linearquadratic mixtures of independent real sources, based on parametric identification of a recurrent separating struc...
Shahram Hosseini, Yannick Deville