15494 search results - page 3052 / 3099 » Computing dynamic clusters |
110
Voted
PPPJ
2009
ACM
15 years 7 months ago
2009
ACM
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its effect has not been examined for ap...
140
click to vote
SAC
2009
ACM
15 years 7 months ago
2009
ACM
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
174
click to vote
GSN
2009
Springer
15 years 6 months ago
2009
Springer
A wireless sensor network deployment on a glacier in Iceland is described. The system uses power management as well as power harvesting to provide long-term environment sensing. Ad...
129
Voted
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
123
click to vote
LPAR
2001
Springer
15 years 6 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...