13436 search results - page 2455 / 2688 » e |
173
click to vote
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
The “Killer Examples” series of workshops are highly interactive workshops which have been an annual occurrence at OOPSLA since 2002. The goals of the workshop are to bring to...
168
click to vote
ACISP
2001
Springer
15 years 10 months ago
2001
Springer
An English auction is the most familiar type of auctions. Generally, an electronic auction has mainly two entities, the registration manager(RM) who treats the registration of bidd...
178
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
155
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
163
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...