1225 search results - page 67 / 245 » The Instance Complexity Conjecture |
AAAI
2008
13 years 11 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
BPM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper presents a tool, the PiVizTool, for the interactive simulation of choreographies. Different participant instances can be added, deleted, and dynamically bound...
DGCI
2006
Springer
14 years 21 days ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...