2430 search results - page 186 / 486 » Computing Tutte Polynomials |
172
click to vote
CONCUR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
182
click to vote
PODS
2012
ACM
13 years 7 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
149
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
167
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
146
Voted
SIGECOM
2003
ACM
15 years 10 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...