7986 search results - page 427 / 1598 » Computational Science and its Applications |
177
Voted
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
178
Voted
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
179
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
146
click to vote
ICYCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents TNC-UTM, a holistic solution to secure enterprise networks from gateway to endpoints. Just as its name suggested, the TNC-UTM solution combines two popular tec...
161
click to vote
SCCC
2008
IEEE
16 years 1 months ago
2008
IEEE
Many Ambient Intelligence (AmI) scenarios fit perfectly for auto-generated distributed networks, but they assume the existence of good enough network topology organizing the conn...