Sciweavers

43 search results - page 5 / 9
» Measuring Complexity of Multi-agent Simulations - An Attempt...
Sort
View
MSO
2003
14 years 10 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
79
Voted
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
14 years 11 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
ICCAD
2007
IEEE
113views Hardware» more  ICCAD 2007»
15 years 3 months ago
The FAST methodology for high-speed SoC/computer simulation
— This paper describes the FAST methodology that enables a single FPGA to accelerate the performance of cycle-accurate computer system simulators modeling modern, realistic SoCs,...
Derek Chiou, Dam Sunwoo, Joonsoo Kim, Nikhil A. Pa...
CSDA
2008
67views more  CSDA 2008»
14 years 9 months ago
How useful are approximations to mean and variance of the index of dissimilarity?
Sociologists, demographers, and economists often use the index of dissimilarity, D, to describe the extent of racial, ethnic, spatial, or areal dissimilarity (or segregation) of d...
Madhuri S. Mulekar, John C. Knutson, Jyoti A. Cham...
ICDCS
2008
IEEE
15 years 3 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta