4451 search results - page 186 / 891 » On Random Ordering Constraints |
134
click to vote
DSN
2007
IEEE
15 years 11 months ago
2007
IEEE
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
154
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
194
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
148
click to vote
COCOON
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
142
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...