Sciweavers

8647 search results - page 684 / 1730
» The Container Selection Problem
Sort
View
CCS
2007
ACM
16 years 1 months ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
EUROCOLT
1999
Springer
15 years 11 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
NIPS
2008
15 years 8 months ago
Structure Learning in Human Sequential Decision-Making
We use graphical models and structure learning to explore how people learn policies in sequential decision making tasks. Studies of sequential decision-making in humans frequently...
Daniel Acuña, Paul R. Schrater
AIPS
2006
15 years 8 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang