465 search results - page 19 / 93 » On the Hardness of Range Assignment Problems |
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
119
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
101
click to vote
IJCAI
2001
15 years 1 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
CEC
2009
IEEE
15 years 3 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
134
click to vote
EURONGI
2008
Springer
15 years 1 months ago
2008
Springer
DED ABSTRACT The increased popularity and the growth in the number of deployed IEEE 802.11 Access Points (APs) have raised the opportunity to merge together various disjointed wire...