889 search results - page 72 / 178 » Problems in Rewriting III |
127
Voted
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
187
click to vote
JMLR
2010
14 years 10 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
138
Voted
ICIW
2009
IEEE
15 years 10 months ago
2009
IEEE
Today’s cross-organizations are increasingly coordinating their capabilities in the quest of dynamically adaptable and thus highly competitive realistic services. Unfortunately,...
117
Voted
ICEIS
2005
IEEE
15 years 9 months ago
2005
IEEE
The World Wide Web contains a huge and increasing volume of information. The web warehouse is an efficient and effective means to facilitate utilization of information on the Web,...
135
click to vote
KBSE
2005
IEEE
15 years 9 months ago
2005
IEEE
The Nix software deployment system is based on the paradigm of transparent source/binary deployment: distributors deploy descriptors that build components from source, while clien...