Sciweavers

2834 search results - page 132 / 567
» Representing Trees with Constraints
Sort
View
AAAI
2004
13 years 11 months ago
Making Argumentation More Believable
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting ar...
Anthony Hunter
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 4 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
14 years 2 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
APWEB
2005
Springer
14 years 3 months ago
An LOD Model for Graph Visualization and Its Application in Web Navigation
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
Shixia Liu, Yue Pan, Liping Yang, Wenyin Liu
CP
2006
Springer
14 years 2 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou