Sciweavers

835 search results - page 32 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
AIPS
2004
13 years 10 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
GLOBECOM
2010
IEEE
13 years 6 months ago
Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
Yan Chen, K. J. Ray Liu
GECCO
2004
Springer
160views Optimization» more  GECCO 2004»
14 years 1 months ago
Finding Effective Software Metrics to Classify Maintainability Using a Parallel Genetic Algorithm
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
Rodrigo A. Vivanco, Nicolino J. Pizzi