Sciweavers

6456 search results - page 7 / 1292
» Constraint Solving on Terms
Sort
View
CEC
2007
IEEE
14 years 1 months ago
An investigation into dynamic problem solving in a hybrid evolutionary market-based multi-agent system
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
D. J. Cornforth
SAC
2002
ACM
13 years 7 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
MICAI
2004
Springer
14 years 22 days ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
CI
2004
85views more  CI 2004»
13 years 7 months ago
Soft Constraint Propagation and Solving in Constraint Handling Rules
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
Stefano Bistarelli, Thom W. Frühwirth, Michae...