12659 search results - page 2319 / 2532 » The distributed breakout algorithms |
173
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
202
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
197
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
181
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
166
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...