116 search results - page 9 / 24 » Gaining Efficiency and Flexibility in the Simple Temporal Pr... |
AAAI
2000
15 years 17 days ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
104
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
100
click to vote
PIMRC
2010
IEEE
14 years 9 months ago
2010
IEEE
Despite all the encouraging reports on the benefit of Partially Overlapped Channels (POCs), the relative simple interference models and rather arbitrary network settings considered...
106
click to vote
WWW
2005
ACM
15 years 12 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
104
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...