Sciweavers

5624 search results - page 207 / 1125
» On Conditional Covering Problem
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
15 years 6 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
PG
1999
IEEE
15 years 11 months ago
Automatic Camera Placement for Image-Based Modeling
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
Shachar Fleishman, Daniel Cohen-Or, Dani Lischinsk...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
INFOCOM
2003
IEEE
16 years 15 days ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
163
Voted
ICCBR
2003
Springer
16 years 13 days ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie