Sciweavers

1168 search results - page 45 / 234
» cases 2000
Sort
View
MOC
2000
127views more  MOC 2000»
13 years 7 months ago
Can a finite element method perform arbitrarily badly?
In this paper we construct elliptic boundary value problems whose standard finite element approximations converge arbitrarily slowly in the energy norm, and show that adaptive proc...
Ivo Babuska, John E. Osborn
MOC
2000
87views more  MOC 2000»
13 years 7 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
DATE
2000
IEEE
113views Hardware» more  DATE 2000»
14 years 14 hour ago
Static Timing Analysis of Embedded Software on Advanced Processor Architectures
This paper examines several techniques for static timing analysis. In detail, the first part of the paper analyzes the connection of prediction accuracy (worst case execution tim...
André Hergenhan, Wolfgang Rosenstiel
WCRE
2000
IEEE
13 years 12 months ago
Designing an XML-based Exchange Format for Harmonia
In this paper we present our design for a program data exchange format for Harmonia, a framework for constructing language-sensitive interactive CASE tools. We discuss the various...
Marat Boshernitsan, Susan L. Graham
ISPD
2000
ACM
92views Hardware» more  ISPD 2000»
13 years 12 months ago
An enhanced perturbing algorithm for floorplan design using the O-tree representation
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
Yingxin Pang, Chung-Kuan Cheng, Takeshi Yoshimura