1046 search results - page 92 / 210 » Approximation Algorithms for Domination Search |
71
Voted
IJCAI
2007
15 years 2 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
133
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
118
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
114
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
100
Voted
HM
2009
Springer
15 years 5 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....