Sciweavers

405 search results - page 33 / 81
» AI planning: solutions for real world problems
Sort
View

Book
357views
15 years 5 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 7 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
IPPS
2007
IEEE
14 years 1 months ago
Distributed Adaptive Particle Swarm Optimizer in Dynamic Environment
Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can be used to find an optimal, or near optimal, solution to a numerical and quali...
Xiaohui Cui, Thomas E. Potok
ECML
2005
Springer
14 years 1 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
EOR
2010
96views more  EOR 2010»
13 years 7 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...