Sciweavers

3172 search results - page 20 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
AI
1998
Springer
13 years 9 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
JMIV
1998
93views more  JMIV 1998»
13 years 9 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
CP
2009
Springer
14 years 10 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...
AINA
2010
IEEE
14 years 2 months ago
A Quadratic, Complete, and Minimal Consistency Diagnosis Process for Firewall ACLs
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
TSD
2009
Springer
14 years 2 months ago
Objective vs. Subjective Evaluation of Speakers with and without Complete Dentures
Abstract. For dento-oral rehabilitation of edentulous (toothless) patients, speech intelligibility is an important criterion. 28 persons read a standardized text once with and once...
Tino Haderlein, Tobias Bocklet, Andreas Maier, Elm...