29 search results - page 6 / 6 » Effectiveness Bounds for Non-Exhaustive Schema Matching Syst... |
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
105
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...