4171 search results - page 564 / 835 » Choice numbers of graphs |
155
click to vote
RSA
2010
15 years 5 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
150
click to vote
SIGECOM
2006
ACM
16 years 19 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
217
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
183
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...
191
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...