Sciweavers

759 search results - page 150 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
BMCBI
2010
137views more  BMCBI 2010»
14 years 9 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 3 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
CP
2003
Springer
15 years 2 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
GECCO
2008
Springer
107views Optimization» more  GECCO 2008»
14 years 10 months ago
The influence of scaling and assortativity on takeover times in scale-free topologies
In evolving systems, the topological characteristics of population structure have a pronounced impact on the rate of spread of advantageous alleles, and therefore affect selective...
Joshua L. Payne, Margaret J. Eppstein