Sciweavers

1723 search results - page 146 / 345
» Cycling in linear programming problems
Sort
View
SAC
2008
ACM
14 years 9 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar
MSWIM
2005
ACM
15 years 3 months ago
The optimal choice of encoding parameters for MPEG-4 AAC streamed over wireless networks
This paper addresses a novel linear programming based approach to optimize the choice of the encoding parameters for the MPEG-4 AAC audio codec. Current techniques solve the encod...
Claus Bauer
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 2 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
ECAI
2010
Springer
14 years 8 months ago
Improving the Global Constraint SoftPrec
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 3 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng