Sciweavers

8196 search results - page 303 / 1640
» Computational Modeling and Complexity Science
Sort
View
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
16 years 18 days ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ICALP
2005
Springer
16 years 5 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ICS
2007
Tsinghua U.
16 years 24 days ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
CCGRID
2001
IEEE
15 years 10 months ago
Performance Evaluation of an Agent-Based Resource Management Infrastructure for Grid Computing
Resource management is an important infrastructure in the grid computing environment. Scalability and adaptability are two key challenges in the implementation of such complex sof...
Junwei Cao, Darren J. Kerbyson, Graham R. Nudd
ICCS
2004
Springer
16 years 18 hour ago
Dynamic-Data-Driven Real-Time Computational Mechanics Environment
Abstract. The proliferation of sensor networks in various areas of technology has enabled real-time behavioral monitoring of various physical systems in various length and time sca...
John Michopoulos, Charbel Farhat, Elias N. Houstis