Sciweavers

389 search results - page 17 / 78
» Some natural decision problems in automatic graphs
Sort
View
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
13 years 11 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 7 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
FLAIRS
2004
13 years 8 months ago
Inducing Fuzzy Decision Trees in Non-Deterministic Domains using CHAID
Most decision tree induction methods used for extracting knowledge in classification problems are unable to deal with uncertainties embedded within the data, associated with human...
Jay Fowdar, Zuhair Bandar, Keeley A. Crockett
FROCOS
2007
Springer
14 years 1 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ECAI
2004
Springer
14 years 23 days ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano