Sciweavers

1991 search results - page 369 / 399
» Using a Coding Standard to Improve Program Quality
Sort
View
SARA
2009
Springer
15 years 4 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
15 years 4 months ago
Explicit model predictive control for linear parameter-varying systems
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
Thomas Besselmann, Johan Löfberg, Manfred Mor...
CP
2007
Springer
15 years 3 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
CP
2005
Springer
15 years 3 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
71
Voted
PRICAI
2004
Springer
15 years 3 months ago
The Happy Searcher: Challenges in Web Information Retrieval
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
Mehran Sahami, Vibhu O. Mittal, Shumeet Baluja, He...