Sciweavers

1091 search results - page 51 / 219
» On the temporal dimension of search
Sort
View
AAAI
2004
15 years 7 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
AICOM
2004
92views more  AICOM 2004»
15 years 6 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
ISCAS
2006
IEEE
96views Hardware» more  ISCAS 2006»
16 years 5 days ago
Frame-level data reuse for motion-compensated temporal filtering
— Motion-compensated temporal filtering (MCTF) is an open-loop prediction scheme, so the frame-level data reuse for MCTF is possible. In this paper, we propose two general frame...
Ching-Yeh Chen, Yi-Hau Chen, Chih-Chi Cheng, Liang...
CISIM
2007
IEEE
16 years 15 days ago
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a P...
Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo...
HIPC
2007
Springer
16 years 9 days ago
Multi-objective Peer-to-Peer Neighbor-Selection Strategy Using Genetic Algorithm
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo ...