357 search results - page 24 / 72 » Solving Generalized Maximum Dispersion with Linear Programmi... |
SODA
1996
ACM
13 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
FPGA
2003
ACM
14 years 2 months ago
2003
ACM
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
CSCLP
2004
Springer
14 years 2 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
IJCAI
1997
13 years 10 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...