760 search results - page 64 / 152 » Algorithms for finding clique-transversals of graphs |
166
click to vote
ALGOSENSORS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
151
click to vote
ENTCS
2008
15 years 5 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
150
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
166
click to vote
NIPS
2004
15 years 6 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
172
Voted
APDC
1997
15 years 6 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...