Sciweavers

14649 search results - page 23 / 2930
» Principles of problem solving
Sort
View
IAT
2006
IEEE
14 years 1 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
JDCTA
2010
272views more  JDCTA 2010»
13 years 2 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
CG
2008
Springer
13 years 9 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
ESANN
2004
13 years 9 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
AMAI
2005
Springer
13 years 7 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov