628 search results - page 94 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
135
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
115
Voted
WINE
2007
Springer
15 years 8 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
126
Voted
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
133
Voted
RCIS
2010
15 years 1 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
127
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...