4110 search results - page 75 / 822 » Efficient algorithms for the 2-gathering problem |
136
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
124
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
143
Voted
CATA
2004
15 years 5 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
113
Voted
APWEB
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
132
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...