6456 search results - page 158 / 1292 » Constraint Solving on Terms |
151
click to vote
PPAM
2005
Springer
15 years 12 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...
186
click to vote
JELIA
2004
Springer
15 years 11 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...
163
click to vote
CSCLP
2006
Springer
15 years 10 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...
134
click to vote
ENDM
2010
15 years 3 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...
166
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...