307 search results - page 60 / 62 » Finite locally-quasiprimitive graphs |
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
14 years 17 days ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
APPROX
2006
Springer
14 years 9 days ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
CCCG
2008
13 years 10 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...