760 search results - page 64 / 152 » Algorithms for finding clique-transversals of graphs |
ALGOSENSORS
2006
Springer
14 years 16 days 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...
ENTCS
2008
13 years 8 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...
ICALP
2000
Springer
14 years 11 days 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...
NIPS
2004
13 years 10 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...
APDC
1997
13 years 10 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...