Sciweavers

4103 search results - page 93 / 821
» Some results on the Collatz problem
Sort
View
WINE
2005
Springer
161views Economy» more  WINE 2005»
15 years 12 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ACCV
2007
Springer
15 years 8 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
COR
2007
163views more  COR 2007»
15 years 6 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
CEC
2009
IEEE
16 years 1 months ago
A multi-objective approach to Redundancy Allocation Problem in parallel-series systems
— The Redundancy Allocation Problem (RAP) is a kind of reliability optimization problems. It involves the selection of components with appropriate levels of redundancy or reliabi...
Zai Wang, Tianshi Chen, Ke Tang, Xin Yao