Sciweavers

1264 search results - page 114 / 253
» The framework approach for constraint satisfaction
Sort
View
AMET
1998
Springer
15 years 10 months ago
Agent-Mediated Integrative Negotiation for Retail Electronic Commerce
Software agents help automate a variety of tasks including those involved in buying and selling products over the Internet. Although shopping agents provide convenience for consume...
Robert H. Guttman, Pattie Maes
AAAI
2000
15 years 7 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
EC
2008
146views ECommerce» more  EC 2008»
15 years 6 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
AAMAS
1999
Springer
15 years 6 months ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 10 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider