Sciweavers

3758 search results - page 485 / 752
» A Complete Subsumption Algorithm
Sort
View
FLAIRS
2004
15 years 8 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
199
Voted
FLAIRS
2004
15 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
DICTA
2003
15 years 8 months ago
Motion Field Estimation for Temporal Textures
This paper presents a novel approach for estimating the flow fields of dynamic temporal textures whose motion differs radically from that of rigid bodies. Our approach is based o...
David Edwards, Johnny T. Chang, Lin Shi, Yizhou Yu
MASCOTS
2004
15 years 7 months ago
A Computational Complexity-Aware Model for Performance Analysis of Software Servers
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
Vipul Mathur, Varsha Apte
UAI
2001
15 years 7 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger