1172 search results - page 184 / 235 » Path Algorithms on Regular Graphs |
122
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
105
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
107
click to vote
ARSCOM
1998
15 years 1 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
123
click to vote
EUROCAST
2007
Springer
15 years 5 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...