2976 search results - page 530 / 596 » On the bounded integer programming |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
SIGSOFT
2004
ACM
14 years 8 months ago
2004
ACM
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...