2725 search results - page 115 / 545 » Constraint Solving for Interpolation |
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we develop an improved approach to the worstcase robust adaptive beamforming for general-rank signal models by means of taking into account the positive semi-defin...
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
115
click to vote
JELIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
100
click to vote
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
ENDM
2010
14 years 10 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...