Sciweavers

176 search results - page 28 / 36
» Improving Test Suites via Operational Abstraction
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
CEC
2007
IEEE
14 years 1 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
PLDI
2010
ACM
14 years 14 days ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...
ISF
2008
114views more  ISF 2008»
13 years 7 months ago
An OVAL-based active vulnerability assessment system for enterprise computer networks
Abstract Many security problems are caused by vulnerabilities hidden in enterprise computer networks. It is very important for system administrators to have knowledge about the sec...
Xiuzhen Chen, Qinghua Zheng, Xiaohong Guan
CPAIOR
2010
Springer
14 years 6 days ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...