16504 search results - page 403 / 3301 » New Problems, New Solutions |
174
click to vote
CAISE
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
158
click to vote
CAV
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
159
click to vote
WDAG
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
179
click to vote
IADIS
2003
15 years 8 months ago
2003
Organisations have encouraged the use of group working over the past 10 years. However this has led to social and cultural upheaval in some organisations. In addition new technolo...
192
click to vote
AAAI
2000
15 years 8 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...