Sciweavers

352 search results - page 59 / 71
» On the optimal reachability problem of weighted timed automa...
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
13 years 11 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
GLOBECOM
2007
IEEE
14 years 1 months ago
Joint Reduction of Peak-to-Average Power Ratio and Out-of-Band Power in OFDM Systems
—The high peak-to-average power ratio is a major drawback of OFDM systems. Many PAPR reduction techniques have been proposed in the literature, among them a method that uses a su...
Martin Senst, Markus Jordan, Meik Dorpinghaus, Mic...