Sciweavers

4860 search results - page 186 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
PODC
2005
ACM
14 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
EVOW
2007
Springer
14 years 2 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
PODS
2010
ACM
181views Database» more  PODS 2010»
14 years 3 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
14 years 2 months ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...