Sciweavers

255 search results - page 14 / 51
» A new upper bound for the bipartite Ramsey problem
Sort
View
WIOPT
2010
IEEE
14 years 9 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
SIAMNUM
2011
110views more  SIAMNUM 2011»
14 years 6 months ago
A Posteriori Error Control for Discontinuous Galerkin Methods for Parabolic Problems
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
Emmanuil H. Georgoulis, Omar Lakkis, Juha M. Virta...
CORR
2008
Springer
111views Education» more  CORR 2008»
14 years 11 months ago
New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
Zilong Wang, Guang Gong
CP
2003
Springer
15 years 5 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
CP
2005
Springer
15 years 5 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...