Sciweavers

2834 search results - page 52 / 567
» Representing Trees with Constraints
Sort
View
DAWAK
2009
Springer
14 years 1 months ago
Mining Violations to Relax Relational Database Constraints
Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a t...
Mirjana Mazuran, Elisa Quintarelli, Rosalba Rossat...
ICPPW
2002
IEEE
14 years 1 months ago
A Structural Framework for Modeling Multi-Stage Network Attacks
Incidents such as Solar Sunrise and Nimda demonstrate the need to expressively model distributed and complex network attacks. To protect information systems, system administrators...
Kristopher Daley, Ryan Larson, Jerald Dawkins
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 2 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
ECAI
2004
Springer
14 years 2 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
CP
2006
Springer
14 years 19 days ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...