Sciweavers

8413 search results - page 1625 / 1683
» Ordering Problem Subgoals
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 4 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 4 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
OPODIS
2007
15 years 4 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
152
Voted
AAAI
2004
15 years 4 months ago
SCoT: A Spoken Conversational Tutor
We describe SCoT, a Spoken Conversational Tutor, which has been implemented in order to investigate the advantages of natural language in tutoring, especially spoken language. SCo...
Karl Schultz, Brady Clark, Heather Pon-Barry, Eliz...
AAAI
2006
15 years 4 months ago
Using an Ontology for Knowledge Acquisition
We describe an approach to distributed knowledge acquisition using an ontology. The ontology is used to represent and reason about soldier performance. These methods are embedded ...
Stacy Lovell, Webb Stacy
« Prev « First page 1625 / 1683 Last » Next »