Sciweavers

697 search results - page 104 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
ICML
2006
IEEE
14 years 8 months ago
Collaborative ordinal regression
Ordinal regression has become an effective way of learning user preferences, but most of research only focuses on single regression problem. In this paper we introduce collaborati...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
CN
2002
98views more  CN 2002»
13 years 7 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
13 years 7 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
BMCBI
2006
101views more  BMCBI 2006»
13 years 7 months ago
Hierarchical modularity of nested bow-ties in metabolic networks
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
Jing Zhao, Hong Yu, Jianhua Luo, Zhi-Wei Cao, Yi-X...