Sciweavers

464 search results - page 71 / 93
» Distributed Constraint-Based Local Search
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...
ATAL
2007
Springer
14 years 2 months ago
Locating RF emitters with large UAV teams
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...
Paul Scerri, Robin Glinton, Sean Owens, Steven Oka...
IAT
2006
IEEE
14 years 1 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
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...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
JNW
2008
171views more  JNW 2008»
13 years 7 months ago
The Necessity of Semantic Technologies in Grid Discovery
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...
Serena Pastore
PODC
2011
ACM
12 years 10 months ago
MIS on trees
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...
Christoph Lenzen, Roger Wattenhofer