1162 search results - page 23 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
156
click to vote
JSAT
2008
15 years 3 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
226
Voted
ADHOCNOW
2011
Springer
14 years 7 months ago
2011
Springer
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service...
119
click to vote
ACSD
2006
IEEE
15 years 9 months ago
2006
IEEE
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
145
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
140
Voted
TCOM
2011
14 years 10 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...