708 search results - page 52 / 142 » Timing closure: the solution and its problems |
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
106
click to vote
ACSAC
2007
IEEE
15 years 2 months ago
2007
IEEE
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
WADS
1997
Springer
15 years 2 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— While there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in ...