Sciweavers

789 search results - page 1 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
WIA
2000
Springer
13 years 8 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto
LATA
2010
Springer
14 years 2 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
IPPS
2000
IEEE
13 years 9 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 8 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
IJCSA
2007
104views more  IJCSA 2007»
13 years 4 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala