5606 search results - page 713 / 1122 » Randomization Techniques for Graphs. |
131
Voted
ATAL
2004
Springer
16 years 8 days ago
2004
Springer
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
203
Voted
ESORICS
2004
Springer
16 years 7 days ago
2004
Springer
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
213
click to vote
ILP
2004
Springer
16 years 7 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
158
Voted
WAIM
2004
Springer
16 years 6 days ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
195
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...