Sciweavers

1672 search results - page 208 / 335
» Tightness problems in the plane
Sort
View
ICS
2007
Tsinghua U.
15 years 5 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
ADHOCNOW
2004
Springer
15 years 4 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
VISUALIZATION
1995
IEEE
15 years 2 months ago
An Integrated Approach for Steering, Visualization, and Analysis of Atmospheric Simulations
In the research described here, we have constructed at tightly coupled set of methods for monitoring, steering, and applying visual analysis to large scale simulations. This work ...
Yves Jean, Thomas Kindler, William Ribarsky, Weimi...
CASES
2008
ACM
15 years 1 months ago
Reducing pressure in bounded DBT code caches
Dynamic binary translators (DBT) have recently attracted much attention for embedded systems. The effective implementation of DBT in these systems is challenging due to tight cons...
José Baiocchi, Bruce R. Childers, Jack W. D...
AAAI
2010
15 years 19 days ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer