Sciweavers

4037 search results - page 395 / 808
» Routing without ordering
Sort
View
125
Voted
VMCAI
2004
Springer
15 years 9 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
78
Voted
CHI
2010
ACM
15 years 9 months ago
Game-y information graphics
In this paper we explore the application of formal elements of games such as goals and scores to information graphics−so called “game-y” information graphics. In order to st...
Nicholas Diakopoulos
99
Voted
DEXAW
2003
IEEE
131views Database» more  DEXAW 2003»
15 years 9 months ago
Having a BLAST: Analyzing Gene Sequence Data with BlastQuest
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...
164
Voted
DEXAW
2003
IEEE
113views Database» more  DEXAW 2003»
15 years 9 months ago
Integrating Ontology Languages and Answer Set Programming
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
Stijn Heymans, Dirk Vermeir
HOTOS
2003
IEEE
15 years 9 months ago
An Analysis of Compare-by-hash
Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two bl...
Val Henson