2976 search results - page 131 / 596 » On the bounded integer programming |
166
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
141
click to vote
IJAC
2010
15 years 3 months ago
2010
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic or...
134
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
143
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
This paper presents a new approach to guaranteed state estimation for nonlinear discrete-time systems with a bounded description of noise and parameters. The sets of states that a...
131
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...