Sciweavers

377 search results - page 60 / 76
» Learning Linear Ordering Problems for Better Translation
Sort
View
IASTEDSEA
2004
14 years 11 months ago
An empirical investigation for different sequences of pedagogical framework documentation in RAD
Frameworks are increasingly employed as a useful way to enable object-oriented reuse. However, their size and complexity make understanding how to use them difficult. Previous wor...
Sin Ban Ho, Ian Chai, Chuie Hong Tan
ICNP
2002
IEEE
15 years 2 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
MFCS
2009
Springer
15 years 2 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
SIGMOD
2012
ACM
242views Database» more  SIGMOD 2012»
13 years 3 days ago
Dynamic management of resources and workloads for RDBMS in cloud: a control-theoretic approach
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
Pengcheng Xiong
INFORMS
1998
100views more  INFORMS 1998»
14 years 9 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...