7055 search results - page 262 / 1411 » Some New 4-Designs |
182
click to vote
DEON
2008
Springer
15 years 8 months ago
2008
Springer
The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control require...
177
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
148
Voted
LREC
2008
15 years 8 months ago
2008
Notwithstanding its acknowledged richness, the SIMPLE semantic model does not offer the representational vocabulary for encoding some conceptual links holding between events and t...
190
click to vote
NIPS
2003
15 years 8 months ago
2003
Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled dynamical systems. One reason why this representation is exciting as...
175
click to vote
ENTCS
2007
15 years 6 months ago
2007
Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace t...