2841 search results - page 371 / 569 » A Call to Order |
182
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
176
click to vote
OWLED
2007
15 years 8 months ago
2007
The research community has noted the need to retrieve the instance level of an ontology from bulk data stored in external data sources (e.g., a relational database), in order to de...
192
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
158
click to vote
AAAI
2006
15 years 8 months ago
2006
Coalition formation is an important capability of automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is...
167
click to vote
AAAI
2006
15 years 8 months ago
2006
People frequently use the world-wide web to find their most preferred item among a large range of options. We call this task preference-based search. The most common tool for pref...