2796 search results - page 427 / 560 » The coolest path problem |
139
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
197
click to vote
EC
1998
15 years 6 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
173
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
The problem of multi-robot patrol in adversarial environments has been gaining considerable interest during the recent years.In this problem, a team of mobile robots is required t...
163
click to vote
JETC
2008
15 years 4 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
184
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...