Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

Spectre, Meltdown, and related attacks have demonstrated that kernels, hypervisors, trusted execution environments, and browsers… Expand

Is this relevant?

2017

2017

This work pursues the idea of multi-forgery attacks as introduced by Ferguson in 2002. We recoin reforgeability for the… Expand

Is this relevant?

2016

2016

The two major concerns of the wireless communication system are throughput of the network and underutilization of wireless… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

This paper presents a genetic algorithm GA for solving the traveling salesman problem TSP. To construct a powerful GA, we use… Expand

Is this relevant?

2012

2012

The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the… Expand

Is this relevant?

2009

2009

A new hybrid method iterative Extended Changing Crossover Operators which can efficiently obtain the optimum solution of the… Expand

Is this relevant?

2009

2009

Trusted computing has been explored through several international initiatives. Trust in a platform generally requires a subset of… Expand

Is this relevant?

2004

2004

Memetic algorithms (MAs) have been shown to be very effective in finding near optimal solutions to hard combinatorial… Expand

Is this relevant?

2004

2004

The edge assembly crossover (EAX) is considered the best available crossover for traveling salesman problems (TSPs). In this… Expand

Is this relevant?

1999

1999

The GA with edge assembly crossover (EAX) has shown a good performance for traveling salesman problems (TSPs). The paper examines… Expand

Is this relevant?