464 search results - page 71 / 93 » Distributed Constraint-Based Local Search |
123
click to vote
IPPS
2007
IEEE
15 years 8 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...
107
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
This chapter describes a principled, yet computationally efficient way for a team of UAVs with Received Signal Strength Indicator (RSSI) sensors to locate radio frequency emitting...
119
Voted
IAT
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
112
click to vote
JNW
2008
15 years 2 months ago
2008
Service discovery and its automation are some of the key features that a large scale, open distributed system must provide so that clients and users may take advantage of shared re...
181
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...