3889 search results - page 607 / 778 » A Framework for Optimizing Paper Matching |
176
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
172
click to vote
IPPS
2006
IEEE
16 years 14 days ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
158
click to vote
SIGIR
2005
ACM
16 years 50 min ago
2005
ACM
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
164
click to vote
EMSOFT
2005
Springer
15 years 12 months ago
2005
Springer
The nature of embedded systems development places a great deal of importance on meeting strict requirements in areas such as static code size, power consumption, and execution tim...
158
click to vote
WLP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...