94 search results - page 7 / 19 » Approximating covering problems by randomized search heurist... |
185
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
160
click to vote
WSC
2008
15 years 8 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
170
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
185
click to vote
GECCO
2007
Springer
16 years 7 hour ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
160
click to vote
EMNLP
2007
15 years 7 months ago
2007
Traditional research on spelling correction in natural language processing and information retrieval literature mostly relies on pre-defined lexicons to detect spelling errors. Bu...