Sciweavers

4190 search results - page 258 / 838
» The Cost of Design
Sort
View
DAC
1999
ACM
15 years 11 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
DSN
2007
IEEE
15 years 11 months ago
A Real-Time Network Traffic Profiling System
This paper presents the design and implementation of a real-time behavior profiling system for high-speed Internet links. The profiling system uses flow-level information from con...
Kuai Xu, Feng Wang 0002, Supratik Bhattacharyya, Z...
USENIX
2008
15 years 9 months ago
Cutting Corners: Workbench Automation for Server Benchmarking
A common approach to benchmarking a server is to measure its behavior under load from a workload generator. Often a set of such experiments is required-perhaps with different serv...
Piyush Shivam, Varun Marupadi, Jeffrey S. Chase, T...
AAAI
2000
15 years 8 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli