Sciweavers

1274 search results - page 138 / 255
» N-fold integer programming
Sort
View
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 3 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
14 years 3 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
ICALP
2003
Springer
14 years 3 months ago
Convergence Time to Nash Equilibria
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
INFOCOM
2002
IEEE
14 years 3 months ago
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
Dirceu Cavendish, Bhaskar Sengupta
IWANN
2001
Springer
14 years 2 months ago
The General Neural-Network Paradigm for Visual Cryptography
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...
Tai-Wen Yue, Suchen Chiang