Sciweavers

1650 search results - page 285 / 330
» The HOM problem is decidable
Sort
View
IJCAI
1989
13 years 8 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 7 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
TRIER
2002
13 years 7 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
ECCV
2010
Springer
13 years 6 months ago
Sequential Non-Rigid Structure-from-Motion with the 3D-Implicit Low-Rank Shape Model
So far the Non-Rigid Structure-from-Motion problem has been tackled using a batch approach. All the frames are processed at once after the video acquisition takes place. In this pa...
Marco Paladini, Adrien Bartoli, Lourdes de Agapito
RR
2010
Springer
13 years 6 months ago
Query-Based Access Control for Ontologies
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
Martin Knechtel, Heiner Stuckenschmidt