Sciweavers

9842 search results - page 427 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IJNS
2000
80views more  IJNS 2000»
15 years 4 months ago
VLSI Implementation of Neural Networks
Currently, fuzzy controllers are the most popular choice for hardware implementation of complex control surfaces because they are easy to design. Neural controllers are more compl...
Bogdan M. Wilamowski, J. Binfet, M. O. Kaynak
IPL
2002
118views more  IPL 2002»
15 years 4 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
KBS
2002
98views more  KBS 2002»
15 years 4 months ago
Integrating AI planning techniques with workflow management system
There is a variety of applications that can benefit from the ability to find optimal or good solutions to a proposed problem automatically. The Artificial Intelligent (AI) communi...
María Dolores Rodríguez-Moreno, Paul...
TOSN
2010
121views more  TOSN 2010»
15 years 3 months ago
Force-directed approaches to sensor localization
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the...
Alon Efrat, David Forrester, Anand Iyer, Stephen G...
FUIN
2010
116views more  FUIN 2010»
15 years 2 months ago
An Investigation of Multi-Agent Planning in CLP
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
Agostino Dovier, Andrea Formisano, Enrico Pontelli