Sciweavers

715 search results - page 107 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
CP
2006
Springer
14 years 7 days ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
AIRWEB
2007
Springer
14 years 2 months ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
IJCAI
2001
13 years 10 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
BMCBI
2005
306views more  BMCBI 2005»
13 years 8 months ago
A method for aligning RNA secondary structures and its application to RNA motif detection
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
Jianghui Liu, Jason Tsong-Li Wang, Jun Hu, Bin Tia...
CVPR
2003
IEEE
14 years 10 months ago
Computing Layered Surface Representations: An Algorithm for Detecting and Separating Transparent Overlays
The biological visual system possesses the ability to compute layered surface representations, in which one surface is represented as being viewed through another. This ability is...
Manish Singh, Xiaolei Huang