2752 search results - page 63 / 551 » Rounding to an Integral Program |
LPNMR
1995
Springer
14 years 9 days ago
1995
Springer
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
MP
2007
13 years 8 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
ISCAS
2003
IEEE
14 years 2 months ago
2003
IEEE
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...