Sciweavers

5165 search results - page 100 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
119
Voted
AAAI
2006
15 years 3 months ago
Weighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
J. H. M. Lee, C. F. K. Siu
116
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 8 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
CPAIOR
2008
Springer
15 years 4 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
FSTTCS
2010
Springer
15 years 15 days ago
Model Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
15 years 11 days ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas