Result 1 to 20 of 76 total
Testable and untestable classes of first-order formulae. (English)
J. Comput. Syst. Sci. 78, No. 5, 1557-1578 (2012).
1
Experimental descriptive complexity. (English)
Constable, Robert L. (ed.) et al., Logic and program semantics. Essays dedicated to Dexter Kozen on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-29484-6/pbk). Lecture Notes in Computer Science 7230, 24-34 (2012).
2
Untestable properties in the Kahr-Moore-Wang class. (English)
Beklemishev, Lev D. (ed.) et al., Logic, language, information and computation. 18th international workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20919-2/pbk). Lecture Notes in Computer Science 6642. Lecture Notes in Artificial Intelligence, 176-186 (2011).
3
Untestable properties in the kahr-Moore-Wang class (English)
WoLLIC, 176-186 (2011).
4
Cyberinfrastructure usage modalities on the teragrid (English)
IPDPS Workshops, 932-939 (2011).
5
Countermeasures: A game for teaching computer security (English)
NETGAMES, 1-6 (2011).
6
A note on the testability of Ramsey’s class. (English)
Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 296-307 (2010).
7
Untestable properties expressible with four first-order quantifiers. (English)
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 333-343 (2010).
8
Social influences related to college students’ use of macintosh computers on an all-PC campus (English)
Computers & Education 55, No. 4, 1542-1551 (2010).
9
Untestable properties expressible with four first-order quantifiers (English)
LATA, 333-343 (2010).
10
A note on the testability of Ramsey’s class (English)
TAMC, 296-307 (2010).
11
Adaptive pose priors for pictorial structures (English)
CVPR, 422-429 (2010).
12
Addressing gaps in knowledge while Reading. (English)
J. Am. Soc. Inf. Sci. Technol. 60, No. 11, 2255-2268 (2009).
13
The number of viable ecological trophic networks. (English)
Math. Comput. Modelling 50, No. 5-6, 947-952 (2009).
14
Relational properties expressible with one universal quantifier are testable. (English)
Watanabe, Osamu (ed.) et al., Stochastic algorithms: Foundations and applications. 5th international symposium, SAGA 2009, Sapporo, Japan, October 26‒28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04943-9/pbk). Lecture Notes in Computer Science 5792, 141-155 (2009).
15
The completable digraphs for the totally nonnegative completion problem. (English)
Linear Algebra Appl. 430, No. 5-6, 1675-1690 (2009).
16
The number of viable ecological trophic networks (English)
Mathematical and Computer Modelling 50, No. 5-6, 947-952 (2009).
17
$N_{0}$ completions on partial matrices (English)
Applied Mathematics and Computation 211, No. 2, 303-312 (2009).
18
Retrieval of single wikipedia articles while Reading abstracts (English)
HICSS, 1-10 (2009).
20
Result 1 to 20 of 76 total
Start
Contact
Print
General Help
