Sciweavers

ICTAI
2005
IEEE
13 years 11 months ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...
ICTAI
2005
IEEE
13 years 11 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden
ICTAI
2005
IEEE
13 years 11 months ago
Hybrid Learning Neuro-Fuzzy Approach for Complex Modeling Using Asymmetric Fuzzy Sets
A hybrid learning neuro-fuzzy system with asymmetric fuzzy sets (HLNFS-A) is proposed in this paper. The learning methods of random optimization (RO) and least square estimation (...
Chunshien Li, Kuo-Hsiang Cheng, Jiann-Der Lee
ICTAI
2005
IEEE
13 years 11 months ago
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
ICTAI
2005
IEEE
13 years 11 months ago
Applying a Taxonomy of Formation Control in Developing a Robotic System
Designing cooperative multi-robot systems (MRS) requires expert knowledge both in control and artificial intelligence. Formation control is an important research within the resea...
Harry Chia-Hung Hsu, Alan Liu
ICTAI
2005
IEEE
13 years 11 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
ICTAI
2005
IEEE
13 years 11 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
ICTAI
2005
IEEE
13 years 11 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
ICTAI
2005
IEEE
13 years 11 months ago
Toward a Logical Tool for Generating New Arguments in an Argumentation Based Framework
Following the framework proposed by Besnard and Hunter for argumentation, this paper aims to propose a logical tool for the generation of new arguments when two formal agents have...
Geoffroy Aubry, Vincent Risch