Sciweavers

336 search results - page 57 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
MST
2006
136views more  MST 2006»
13 years 8 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ITSL
2008
13 years 10 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
COMCOM
2007
84views more  COMCOM 2007»
13 years 8 months ago
A genetic approach for adding QoS to distributed virtual environments
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
Silvia Rueda, Pedro Morillo, Juan M. Orduña...
COR
2007
134views more  COR 2007»
13 years 8 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez