Sciweavers

3049 search results - page 329 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
DATE
2000
IEEE
169views Hardware» more  DATE 2000»
15 years 11 months ago
Transformational Placement and Synthesis
Novel methodology and algorithms to seamlessly integrate logic synthesis and physical placement through a transformational approach are presented. Contrary to most placement algor...
Wilm E. Donath, Prabhakar Kudva, Leon Stok, Paul V...
173
Voted
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 11 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
CLUSTER
2001
IEEE
15 years 10 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 6 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
ATAL
2007
Springer
16 years 26 days ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...