Sciweavers

2257 search results - page 215 / 452
» Secure program partitioning
Sort
View
DISOPT
2008
113views more  DISOPT 2008»
13 years 10 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
EOR
2010
110views more  EOR 2010»
13 years 10 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
EC
2008
153views ECommerce» more  EC 2008»
13 years 10 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
WCET
2010
13 years 8 months ago
On the Use of Context Information for Precise Measurement-Based Execution Time Estimation
The present paper investigates the influence of the execution history on the precision of measurementbased execution time estimates for embedded software. A new approach to timing...
Stefan Stattelmann, Florian Martin
ICALP
2011
Springer
13 years 2 months ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato