Sciweavers

14548 search results - page 73 / 2910
» The Optimal Path-Matching Problem
Sort
View
JCST
2010
109views more  JCST 2010»
13 years 4 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
ICALP
2011
Springer
13 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
AAAI
2011
12 years 10 months ago
The Steiner Multigraph Problem: Wildlife Corridor Design for Multiple Species
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...
Katherine J. Lai, Carla P. Gomes, Michael K. Schwa...
EOR
2002
74views more  EOR 2002»
13 years 9 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
IPL
1998
119views more  IPL 1998»
13 years 9 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh