187 search results - page 29 / 38 » On the uniform edge-partition of a tree |
81
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
ICDE
2006
IEEE
15 years 3 months ago
2006
IEEE
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
IWDC
2005
Springer
15 years 3 months ago
2005
Springer
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...