Sciweavers

1815 search results - page 100 / 363
» Path Planning for Network Performance
Sort
View
DAC
2006
ACM
14 years 9 months ago
A new LP based incremental timing driven placement for high performance designs
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
Tao Luo, David Newmark, David Z. Pan
DSN
2007
IEEE
14 years 2 months ago
Fault Tolerant Planning for Critical Robots
Autonomous robots offer alluring perspectives in numerous application domains: space rovers, satellites, medical assistants, tour guides, etc. However, a severe lack of trust in t...
Benjamin Lussier, Matthieu Gallien, Jér&eac...
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
13 years 6 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
COMCOM
2008
99views more  COMCOM 2008»
13 years 8 months ago
Performance implications of fluctuating server capacity
In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. Given a set of primary inputs, such as arrival rate, service rate, and capacity fl...
Jingxiang Luo, Carey L. Williamson
CCR
2002
85views more  CCR 2002»
13 years 8 months ago
Large-scale experimental study of Internet performance using video traffic
In this paper, we analyze the results of a seven-month real-time streaming experiment, which was conducted between a number of unicast dialup clients, connecting to the Internet t...
Dmitri Loguinov, Hayder Radha