Sciweavers

750 search results - page 36 / 150
» Desires, Norms and Constraints
Sort
View
INFOCOM
2007
IEEE
15 years 8 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
AAAI
2004
15 years 3 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 9 days ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
AIPS
2006
15 years 3 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
NIPS
2008
15 years 3 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari