Sciweavers

1816 search results - page 203 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
IPPS
2007
IEEE
16 years 26 days ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
ICCBR
2009
Springer
16 years 1 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
16 years 17 days ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
EVOW
2007
Springer
16 years 22 days ago
Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
FLAIRS
2006
15 years 8 months ago
GFAM: Evolving Fuzzy ARTMAP Neural Networks
Fuzzy ARTMAP (FAM) is one of the best neural network architectures in solving classification problems. One of the limitations of Fuzzy ARTMAP that has been extensively reported in...
Ahmad Al-Daraiseh, Michael Georgiopoulos, Annie S....