Sciweavers

12950 search results - page 581 / 2590
» On Optimal Timed Strategies
Sort
View
151
Voted
ISCAS
2003
IEEE
150views Hardware» more  ISCAS 2003»
16 years 21 days ago
Accurate rise time and overshoots estimation in RLC interconnects
A closed form expression for the rise time of a gate driving a distributed RLC line is introduced that is within 8% of dynamic circuit simulations for a wide range of RLC loads. I...
Noha H. Mahmoud, Yehea I. Ismail
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 8 months ago
A time efficient Delaunay refinement algorithm
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
Gary L. Miller
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
15 years 8 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
AMC
2010
69views more  AMC 2010»
15 years 7 months ago
The Leitmann-Schmitendorf advertising game with n players and time discounting
The extension of the Leitmann-Schmitendorf advertising game to n players and positive time discounting is investigated. We show that the strong time consistency of the open-loop N...
Davide Dragone, Luca Lambertini, Arsen Palestini
158
Voted
TCS
2008
15 years 7 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang