Sciweavers

3433 search results - page 437 / 687
» Heuristics for a bidding problem
Sort
View
DATE
1998
IEEE
73views Hardware» more  DATE 1998»
15 years 11 months ago
On Removing Multiple Redundancies in Combinational Circuits
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
David Ihsin Cheng
INFOCOM
1996
IEEE
15 years 11 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
MM
1994
ACM
125views Multimedia» more  MM 1994»
15 years 10 months ago
Two-Dimensional Scaling Techniques for Adaptive, Rate-Based Transmission Control of Live Audio and Video Streams
: One of the major obstacles facing designers of video conferencing systems is the problem of ameliorating the effects of congestion on interconnected packet-switched networks that...
Terry Talley, Kevin Jeffay
ICML
1990
IEEE
15 years 10 months ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...