Sciweavers

23 search results - page 4 / 5
» Combining multiple heuristics on discrete resources
Sort
View
JAIR
2007
141views more  JAIR 2007»
13 years 8 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
DBSEC
2008
152views Database» more  DBSEC 2008»
13 years 9 months ago
An Attack Graph-Based Probabilistic Security Metric
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
Lingyu Wang, Tania Islam, Tao Long, Anoop Singhal,...
COR
2010
123views more  COR 2010»
13 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
TASE
2008
IEEE
13 years 8 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser
DSN
2006
IEEE
14 years 2 months ago
Designing dependable storage solutions for shared application environments
The costs of data loss and unavailability can be large, so businesses use many data protection techniques, such as remote mirroring, snapshots and backups, to guard against failur...
Shravan Gaonkar, Kimberly Keeton, Arif Merchant, W...