Sciweavers

1725 search results - page 216 / 345
» Relaxed genetic programming
Sort
View
CIS
2008
Springer
15 years 6 hour ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
SNPD
2003
14 years 11 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
ENDM
2010
101views more  ENDM 2010»
14 years 10 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
EOR
2007
87views more  EOR 2007»
14 years 10 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
MP
2006
94views more  MP 2006»
14 years 10 months ago
Optimization-based simulation of nonsmooth rigid multibody dynamics
We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtrac...
Mihai Anitescu