Sciweavers

565 search results - page 64 / 113
» Heuristics for Planning with SAT
Sort
View
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 9 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
GECCO
2009
Springer
14 years 2 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
ICCBR
2005
Springer
14 years 1 months ago
Case Adaptation by Segment Replanning for Case-Based Planning Systems
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
Flavio Tonidandel, Marcio Rillo
AIIA
2009
Springer
14 years 20 days ago
Optimal Planning with ACO
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
CAEPIA
2007
Springer
14 years 7 hour ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson