Sciweavers

14739 search results - page 304 / 2948
» An optimization problem on the sphere
Sort
View
FLAIRS
2003
15 years 22 days ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
IJCAI
2003
15 years 22 days ago
Active Probing Strategies for Problem Diagnosis in Distributed Systems
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
Mark Brodie, Irina Rish, Sheng Ma, Natalia Odintso...
UAI
2004
15 years 22 days ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
WSCG
2000
117views more  WSCG 2000»
15 years 20 days ago
Solving Multiple Layer Containment Problems Using Iterative Methods
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...
Nuno Marques, Pedro Capela, João Bernardo
AAAI
1996
15 years 20 days ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein