1071 search results - page 194 / 215 » Theories of Automatic Structures and Their Complexity |
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
WSE
2006
IEEE
15 years 3 months ago
2006
IEEE
For web applications, determining how requests from a web page are routed through server components can be time-consuming and error-prone due to the complex set of rules and mecha...
82
Voted
ACSAC
2002
IEEE
15 years 2 months ago
2002
IEEE
Security analysis should take advantage of a reliable knowledge base that contains semantically-rich information about a protected network. This knowledge is provided by network m...
81
Voted
ECOOP
1999
Springer
15 years 1 months ago
1999
Springer
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
GRAPHICSINTERFACE
2000
14 years 11 months ago
2000
Skinning geometry effectively continues to be one of the more challenging and time consuming aspects of character setup. While anatomic and physically based approaches to skinning...