Sciweavers

1933 search results - page 187 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
FOCS
1995
IEEE
15 years 8 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 4 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
MFCS
2000
Springer
15 years 8 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
SC
2004
ACM
15 years 9 months ago
Optimal File-Bundle Caching Algorithms for Data-Grids
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
Ekow J. Otoo, Doron Rotem, Alexandru Romosan
CEC
2010
IEEE
15 years 4 months ago
Designing airfoils using a reference point based evolutionary many-objective particle swarm optimization algorithm
— In this paper, we illustrate the use of a reference point based many-objective particle swarm optimization algorithm to optimize low-speed airfoil aerodynamic designs. Our fram...
Upali K. Wickramasinghe, Robert Carrese, Xiaodong ...