Sciweavers

13376 search results - page 141 / 2676
» Problem Solving with
Sort
View
CEC
2007
IEEE
15 years 9 months ago
Towards an immune system that solves CSP
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
María-Cristina Riff, Marcos Zú&ntild...
ICEC
1996
123views more  ICEC 1996»
15 years 4 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
MOR
2002
94views more  MOR 2002»
15 years 2 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
MOC
2000
84views more  MOC 2000»
15 years 2 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot
CCS
2001
ACM
15 years 7 months ago
Constraint solving for bounded-process cryptographic protocol analysis
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
Jonathan K. Millen, Vitaly Shmatikov