8540 search results - page 1430 / 1708 » The Dynamic Servers Problem |
144
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
The growing infrastructure for Web Services assumes a "programmer in the loop" that hardcodes the connections between Web Services and directly programs Web Service comp...
242
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
231
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
120
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
119
click to vote
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Domestic ubiquitous computing systems often rely on inferences about activities in the home, but the open-ended, dynamic and heterogeneous nature of the home poses serious problem...