137 search results - page 23 / 28 » An Improved Integer Local Search for Complex Scheduling Prob... |
AAAI
2004
13 years 10 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
CEC
2010
IEEE
13 years 20 days ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
ADC
2006
Springer
14 years 3 months ago
2006
Springer
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
PODC
2011
ACM
12 years 12 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...