11345 search results - page 1796 / 2269 » Foundations of Computer Science |
137
Voted
MST
1998
15 years 4 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
188
click to vote
GEM
2009
15 years 2 months ago
2009
- Understanding how systems can be designed to be evolvable is fundamental to research in optimization, evolution, and complex systems science. Many researchers have thus recognize...
152
click to vote
CONSTRAINTS
2010
15 years 2 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
175
Voted
CHI
2011
ACM
14 years 8 months ago
2011
ACM
Patients’ basic understanding of clinical events has been shown to dramatically improve patient care. We propose that the automatic generation of very short microexplanations, s...
169
click to vote
ICONFERENCE
2011
14 years 8 months ago
2011
An annotator’s classification of a text not only tells us something about the intent of the text’s author, it also tells us something about the annotator’s standpoint. To un...