1686 search results - page 275 / 338 » Programs as polygraphs: computability and complexity |
133
click to vote
CONEXT
2005
ACM
15 years 2 months ago
2005
ACM
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
139
Voted
PPSC
2001
15 years 2 months ago
2001
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
131
click to vote
PARCO
2003
15 years 2 months ago
2003
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
122
Voted
ACMACE
2009
ACM
15 years 1 months ago
2009
ACM
We here present Fun in Numbers (FinN), a framework for developing pervasive applications and interactive installations for entertainment and educational purposes. Using ad hoc mob...
116
Voted
GRID
2008
Springer
15 years 1 months ago
2008
Springer
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...