4451 search results - page 266 / 891 » On Random Ordering Constraints |
158
click to vote
IAT
2003
IEEE
15 years 12 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
153
click to vote
AAAI
2007
15 years 9 months ago
2007
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
170
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
150
click to vote
CRYPTO
2004
Springer
16 years 1 days ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
162
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...