Sciweavers

1110 search results - page 5 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
CCGRID
2003
IEEE
14 years 3 months ago
Chameleon: A Resource Scheduler in A Data Grid Environment
Grid computing is moving into two ways. The Computational Grid focuses on reducing execution time of applications that require a great number of computer processing cycles. The Da...
Sang-Min Park, Jai-Hoon Kim
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
14 years 1 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
BMCBI
2010
82views more  BMCBI 2010»
13 years 10 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...
WSC
2004
13 years 11 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
FOCS
1995
IEEE
14 years 1 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