Sciweavers

7988 search results - page 1388 / 1598
» A Useful Undecidable Theory
Sort
View
MATES
2004
Springer
15 years 9 months ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen
SBIA
2004
Springer
15 years 9 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 9 months ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali
PLDI
2003
ACM
15 years 9 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
SENSYS
2003
ACM
15 years 9 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
« Prev « First page 1388 / 1598 Last » Next »