Sciweavers

113 search results - page 9 / 23
» A new Approach for Solving Satisfiability Problems with Qual...
Sort
View
IOR
2006
173views more  IOR 2006»
13 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
JCP
2006
83views more  JCP 2006»
13 years 7 months ago
Concurrent Failures and Redundant Protection Problem in Hierarchical GMPLS Networks
The generalized multiprotocol label switching (GMPLS) networks attain a hierarchical structure, and each layer maintains an independent protection mechanism, resulting in redundant...
Sung-eok Jeon
CVPR
2012
IEEE
11 years 10 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
AIPS
2006
13 years 9 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...