Sciweavers

1381 search results - page 81 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
ATAL
2005
Springer
15 years 9 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
SAS
2001
Springer
15 years 8 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
SIBGRAPI
2005
IEEE
15 years 9 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
COMPULOG
1999
Springer
15 years 8 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
DAC
2000
ACM
16 years 5 months ago
Dynamic power management of complex systems using generalized stochastic Petri nets
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
Qinru Qiu, Qing Wu, Massoud Pedram