Sciweavers

980 search results - page 50 / 196

» Decentralized Constraint Satisfaction

30

APPROX
2008
Springer

128views Algorithms» more APPROX 2008»

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

13 years 9 months ago

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

Download www.cs.cmu.edu

Venkatesan Guruswami, Prasad Raghavendra

claim paper

Read More »

20

CPAIOR
2008
Springer

91views Operations Research» more CPAIOR 2008»

The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

13 years 9 months ago

The Polytope of Tree-Structured Binary Constraint Satisfaction Problems

Download www.cs.brown.edu

Meinolf Sellmann

claim paper

Read More »

23

AAAI
2006

97views Intelligent Agents» more AAAI 2006»

Evaluation of Solving Models for Conditional Constraint Satisfaction Problems

13 years 9 months ago

Evaluation of Solving Models for Conditional Constraint Satisfaction Problems

Download www.aaai.org

Mihaela Sabin, Esther Gelle

claim paper

Read More »

18

ACL
2004

75views Computational Linguistics» more ACL 2004»

Question Answering Using Constraint Satisfaction: QA-By-Dossier-With-Contraints

13 years 9 months ago

Question Answering Using Constraint Satisfaction: QA-By-Dossier-With-Contraints

Download acl.ldc.upenn.edu

John M. Prager, Jennifer Chu-Carroll, Krzysztof Cz...

claim paper

Read More »

27

FLAIRS
2004

119views Artificial Intelligence» more FLAIRS 2004»

A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms

13 years 9 months ago

A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms

Download www.aaai.org

In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...

Debasis Mitra, Hyoung-rae Kim

claim paper

Read More »

« Prev « First page 50 / 196 Last » Next »