4744 search results - page 426 / 949 » Connected Computing |
150
Voted
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
158
click to vote
NAACL
2010
15 years 4 months ago
2010
Open-class semantic lexicon induction is of great interest for current knowledge harvesting algorithms. We propose a general framework that uses patterns in bootstrapping fashion ...
178
Voted
NAACL
2010
15 years 4 months ago
2010
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
167
click to vote
OPODIS
2010
15 years 4 months ago
2010
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
185
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...