Sciweavers

840 search results - page 14 / 168
» The Complexity of the Extended GCD Problem
Sort
View
CSL
2010
Springer
13 years 8 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
MVA
2002
147views Computer Vision» more  MVA 2002»
13 years 7 months ago
Extraction of Character String Areas from Color Scenery Image Using Extended Psychological Potential Field
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
Masanori Anegawa, Akira Nakamura
ICTAI
2003
IEEE
14 years 1 months ago
Task Allocation via Multi-Agent Coalition Formation: Taxonomy, Algorithms and Complexity
Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three drivin...
Hoong Chuin Lau, Lei Zhang
PRDC
2007
IEEE
14 years 2 months ago
Failure Detectors and Extended Paxos for k-Set Agreement
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu
ATAL
2008
Springer
13 years 9 months ago
Extending agent languages for autonomy
BDI agent languages provide a useful abstraction for complex systems comprised of interactive autonomous entities, but they have been used mostly in the context of single agents w...
Felipe Rech Meneguzzi