7430 search results - page 595 / 1486 » Programming Applications in CIFF |
200
click to vote
CIDU
2010
15 years 4 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
210
click to vote
BWCCA
2010
15 years 2 months ago
2010
Abstract--This paper studies the application of an approach to enhance information security awareness amongst employees within middleeastern companies, in effort to improve informa...
231
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
211
click to vote
IFIP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
198
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...