Sciweavers

2060 search results - page 54 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
ANSS
2006
IEEE
15 years 3 months ago
Grid-Boxing for Spatial Simulation Performance Optimisation
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
Kenneth A. Hawick, Heath A. James, C. J. Scogings
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 4 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
CII
2006
141views more  CII 2006»
14 years 9 months ago
FPGA-based tool path computation: An application for shoe last machining on CNC lathes
Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed, most of them are only useful for s...
Antonio Jimeno, José Luis Sánchez, H...
NETGAMES
2006
ACM
15 years 3 months ago
A practical pricing model of inter-domain multicasting based on game theory
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...
Jinjing Zhao, Peidong Zhu, Xicheng Lu, Feng Zhao