Sciweavers

1165 search results - page 131 / 233
» Effective linear programming based placement methods
Sort
View
CP
2005
Springer
15 years 8 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
LCTRTS
2005
Springer
15 years 8 months ago
A sample-based cache mapping scheme
Applications running on the StrongARM SA-1110 or XScale processor cores can specify cache mapping for each virtual page to achieve better cache utilization. In this work, we descr...
Rong Xu, Zhiyuan Li
4OR
2006
100views more  4OR 2006»
15 years 3 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
EUSFLAT
2009
153views Fuzzy Logic» more  EUSFLAT 2009»
15 years 24 days ago
A Type-2 Fuzzy Portfolio Selection Problem Considering Possibility Measure and Crisp Possibilistic Mean Value
This paper considers a portfolio selection problem with type-2 fuzzy future returns involving ambiguous and subjectivity. Since this proposed problem is not well-defined due to fuz...
Takashi Hasuike, Hiroaki Ishii
CLA
2007
15 years 4 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig