Publications
Found 1886 results
Author [ Title![(Desc)](https://icsi.berkeley.edu/icsi/sites/all/modules/biblio/misc/arrow-desc.png)
Filters: First Letter Of Last Name is S [Clear All Filters]
(1994).
On the Complexity of Haplotyping via Perfect Phylogeny.
Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
(2004). On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
(1998).
(2009).
(1987).
(1996).
(1991).
(2001). A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition.
Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93). 202-207.
(1993). Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification.
INFORMS Journal on Computing.
(2004). Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification.
INFORMS Journal on Computing.
(2004). A Computationally Efficient Abstraction of Long-term Potentiation.
Neurocomputing. 44-46, 33-41.
(2002).
(1996).
(2011). Congestion Control for Best Effort Service: Why We Need a New Paradigm.
IEEE Network Magazine. 10(1), 10-19.
(1996).
(2003).
(2002). A Connectionist Encoding of Parameterized Schemas and Reactive Plans.
Proceedings of the First SMART-Symposium. 1-28.
(1999).
(2002).
(2002).
(2004). A Connectionist Model of Planning via Back-Chaining Search.
Proceedings of the 20th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001).
(2001). A Connectionist Model of Planning via Back-Chaining Search.
Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
(2002).
(1989). Connectionist Symbol Processing: Dead or Alive?.
(Jagota, A.., Plate T.., Shastri L., & Sun R.., Ed.).2, 1-40.
(1999).