1722 search results - page 256 / 345 » Variables in Concept Graphs |
135
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
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...
139
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
146
Voted
EUROCAST
2007
Springer
15 years 7 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
135
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
163
click to vote
AI
2011
Springer
14 years 11 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...