1158 search results - page 153 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
167
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
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...
171
click to vote
NIPS
1998
15 years 7 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
176
click to vote
ESANN
2007
15 years 7 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
145
click to vote
TIT
2002
15 years 5 months ago
2002
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
163
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...