Sciweavers

8067 search results - page 114 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
JAIR
2007
141views more  JAIR 2007»
15 years 3 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
CSCLP
2006
Springer
15 years 7 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
182
Voted
CVPR
2009
IEEE
16 years 10 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...
126
Voted
CPAIOR
2010
Springer
15 years 8 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi
JCST
2010
109views more  JCST 2010»
14 years 10 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