708 search results - page 96 / 142 » Timing closure: the solution and its problems |
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
FAST
2008
15 years 9 days ago
2008
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
JPDC
2007
14 years 10 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
104
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...