Sciweavers

2423 search results - page 442 / 485
» AnswerArt - Contextualized Question Answering
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 3 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
ESOP
1990
Springer
15 years 3 months ago
Algebraic Properties of Program Integration
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
Thomas W. Reps
OA
1989
237views Algorithms» more  OA 1989»
15 years 3 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
CIE
2007
Springer
15 years 3 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
DAC
2007
ACM
15 years 3 months ago
Performance Analysis of FlexRay-based ECU Networks
It is now widely believed that FlexRay will emerge as the predominant protocol for in-vehicle automotive communication systems. As a result, there has been a lot of recent interes...
Andrei Hagiescu, Unmesh D. Bordoloi, Samarjit Chak...