Skip to search formSkip to main contentSkip to account menu

Wait-for graph

Known as: WFG, Wait For Graph 
A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. In… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Recently, it was shown that Many-Objective Evolutionary Algorithms (MaOEAs) that employ a set of convex weight vectors are… 
2017
2017
Most Multi-objective Evolutionary Algorithms (MOEAs) operate without explicitly promoting the diversity of the variable space… 
2013
2013
In a comparison of two wavefront-guided excimer lasers, one platform provides better clinical results on some measures but cannot… 
2013
2013
Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has become increasingly popular in solving multi-objective… 
2009
2009
As PV — distributed generation (DG-PV) penetration increases, its reaction with various system disturbances (i.e. voltage drop… 
2008
2008
We present two methods for synthesizing large concurrent programs from temporal logic specifications. The first method deals with… 
2005
2005
Bandpass sampling, reconstruction, and antialiasing filtering in analog front ends potentially provide the best performance of… 
1998
1998
This paper presents an algorithm for resolving OR deadlocks in distributed systems. The algorithm works in two concurrent phases… 
1986
1986
In the letter a generalised stop-and-wait ARQ technique with soft error detection is proposed which achieves a higher throughput…