1055 search results - page 34 / 211 » Enumerations in computable structure theory |
COMPSAC
2009
IEEE
14 years 2 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
FECS
2006
13 years 11 months ago
2006
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
IDA
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we introduce three alternative combinatorial formulations of the theory of evidence (ToE), by proving that both plausibility and commonality functions share the stru...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
SIGSOFT
2007
ACM
14 years 10 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...