569 search results - page 94 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
MST
2006
13 years 7 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
WPES
2003
ACM
14 years 23 days ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
DSRT
2008
IEEE
14 years 2 months ago
2008
IEEE
In the past decade parallel disk systems have been highly scalable and able to alleviate the problem of disk I/O bottleneck, thereby being widely used to support a wide range of d...